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?

Make Yourself Replaceable

No One Needs Us Anymore – Claude Opus 5.5 Music Video

What Instagram Research Taught Me About Scraping Reliability

Article on a new Russian nuclear submarine (Khabarovsk Project 09851)

M715q Power Usage and the BSDes

Claude Code slyly adding users' emails to outbound HTTP

William the Conqueror and the Oath of Sarum

Infinity: A runtime for extreme agent concurrency

I'm creating my own OS system. Please rate this. There's a lot written in C

Peer-review failures at NeurIPS, IEEE, and ACM introduced flawed AI logic

Ramblr (FOSS) – Tap-to-dictate voice input for Android

Frame of preference. A history of Mac settings, 1984-2004 (2025) With emulators

Listening to Nina Simone in 2036

Show HN: Benchmarks of continual learning model trained for a month on a laptop

BBC edits out pride pins on University Challenge in 'Orwellian' move

Sanctum, Linux desktop environment made with Rust and Freya

Auto-exist – Flow-state induction via raw mouse input (a biohacking experiment)

List of demonyms for U.S. states and territories

GPU-unlock: FP/BF16 instruction issue rate on Nvidia 3000's cards

Europe's Energy Policy Is Economic Suicide

SideNote

I Don't Understand Quantum Physics

Book Review: The Ghost in My Brain

How Improved Voicebot agents now? Does Help Sales and support end to end

France is looking ungovernable. And it's going to get worse – FT Essay

Took apart Claude Code, then turned it into a free course on harness engineering

NASA, Partners Accelerate Lander Development for 2028 Moon Missions

Show HN: Duetto – pretrained music transformer that plays a piano with you

I ported foot terminal to macOS

The Implications of Links (1997)