Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•1y ago

Comments

nine_k•1y ago

> Introducing the ‘packed’ data format, a binary format that allows using data as it is, without the need for a deserialisation step. A notable perk of this format is that traversals on packed trees is proven to be faster than on ‘unpacked’ trees: as the fields of data structures are inlines, there are no pointer jumps, thus making the most of the L1 cache.

That is, a "memory dump -> zero-copy memory read" of a subgraph of Haskell objects, allowing to pass such trees / subgraphs directly over a network. Slightly reminiscent of Cap'n Proto.

90s_dev•1y ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•1y ago

They mention this in the article.

spockz•1y ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•1y ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•1y ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•1y ago

> the serialised version of the data is usually bigger than its in-memory representation

I don’t think this is common. Perhaps for arrays of floats serialized as JSON or something. But I can’t think of a case where binary serialization is bigger. Data types like maps are necessarily larger in memory to support fast lookup and mutability.

nine_k•1y ago

I suppose all self-describing formats, like protobuf, or thrift or, well, JSON are bigger than the efficient machine representation, because they carry the schema in every message, one way or another.

IsTom•1y ago

If you use a lot of sharing in immutable data it can grow a lot when serializing. A simple pathological example would be a tree that has all left subtrees same as the right ones. It takes O(height) space in memory, but O(2^height) when serialized.

gitroom•1y ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•1y ago

This was very well written. Excellent article!

NetOpWibby•1y ago

Is this like MessagePack for Haskell?

Show HN: ShevtoneAudio Orchestrator – Turning MIDI into Full Orchestration

Kima: Self-Hosted Spotify-Like Streaming for Your Own Music Library

Secret ratio property of cubic functions

Show HN: My startup-idea scanner scored 500 ideas; the best got 6.3/10

Uruky reached 300 monthly active accounts!

Physically Immutable Optical Archive Libraries

One Nix flake to rule them all

British Public Oppose Secret Surveillance Powers and Want Strong Protections

When it comes to China, America has a plan

Show HN: 1endpoint – Cheaper access to AI models

How Culture Shapes the Stories We Tell About Our Emotions (2024)

Some Scientists Have 'Magic Hands' in the Lab. This A.I. Is Learning Why.

What It Took to Dismantle the Most Powerful Company in the World

Atlantropa

Iceland votes 'No' to reopening EU accession talks

Rehearse a specific English work conversation before you have it

Groom of the Stool

IguanaTex

Innovation Doesn't Happen on Schedule

The largest electric plane takes flight today

Scientists Create the Littlest Big Bang to Study the Universe's Origins

When Led Zeppelin bombed in front of 1.9B people [video]

Show HN: The Thousand – 1k founders, 1 question, one book

Google Maps – Lake America

Columbia House Is Shutting Down

He Did Not Conquer: Franklin's Failure to Annex Canada

Show HN: Get your free AI search visibility scan

Tortoise and the Birds – an African folktale recreated with Lego animation [video]

Show HN: Nuzzle – adorable live wallpapers of your pets

Against Dumb Vibe Coding, Not Vibe Coding