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: Webcam games my kids can only play by moving

A Blacklisted Chinese Tech Giant Kept Buying Nvidia's Best A.I. Chips

Invoiciz: Easy Invoice Maker

I asked astra to make playable 4D chess

Gaming Chairs (2026): Are They Worth It?

AnTuTu V12 public beta arrives with major changes to how phones are benchmarked

Pigeon, a signed Pass for what a sub-agent may do

Uptime – A hard tech thriller grounded in real system engineering

Show HN: Wayfinder – A reference implementation for evaluating AI applications

Turn any X post into a vertical video

Blink – E-commerce platform where you shop through video reels

I Changed My License

Runtipi: Homeserver Management Made Easy

Photosystem II Complex: Nature's Most Brutal 'Battery' (Superoxidizing Force)

Building a new programming language – looking for contributors

Relax about Neural Space

Glide Menu: A one-handed gesture for mobile apps

The Slopconomy and Its Alternatives

Projecting application state as a filesystem with FUSE

Whose Intelliegence is more Artificial?

M2: Episode 1 (Or, Asahi Linux on M3)

Nvidia is the central bank of AI

The Elephant in the Brownfield

Rogue iOS developer creates app that simulates messages sent by carrier pigeon

The Harness, the Horse, or the Hay – By Brett Queener

Find Your Next Book by Mood

Onionspector – now let's see what The Onion knows about you

Opus (Audio Format)

SeekMoon: From IDE to ADE

Podcast: We Spoke to an Amazon Worker Destroying Books for AI