Packed Data Support in Haskell

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

77•matt_d•7mo ago

Comments

nine_k•7mo 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•7mo ago

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

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

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

cstrahan•7mo ago

No, one example of why being variable sized integers.

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

carterschonwald•7mo ago

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

tlb•7mo 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•7mo 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•7mo 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•7mo ago

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

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Rebuilding Our Website for the Agent Era

Engineering analysis of 3I/ATLAS as a sublimation-driven body

Show HN: EdgeVec – Sub-millisecond vector search in the browser (Rust/WASM)

'Mamdani Effect' Is Seeing More People Moving to New York, Not Leaving It

Portals must bend gravity [video]

Show HN: I needed to record mobile web demos with my face, so I built this

Show HN: PharmVault – Secure Notes with Spring Boot and JWT

GPT 5.2 on the Counter-Strike Benchmark

How does one analyse all states of a puzzle game like Stephen's Sausage Roll? [video]

Deletion is never guaranteed: How your computer lies to you

Can I use HTTPS RRs?

Arizona city rejects data center after AI lobbying push

Fine-tuning Gemma 3 for mobile

Working at Cold War Los Alamos

Shifting climate boundaries for European peatlands

Don't Gobble Up Errors

Cadbury Ruined Its Taste and Betrayed Britain [video]

Every Meeting Should Start on Time (If You Want It to Be Productive)

Sanity Check Documents with Riftur

Wine 11.0 RC2 – Run Windows Applications on Linux, BSD, Solaris and macOS

GCP Error Fixing Bot

Show HN: Tiny VM sandbox in C with apps in Rust, C and Zig

Ask HN: Go all-in on AI Boom vs. enjoy parenthood?

Show HN: VoiceGrab – Free voice-to-text for Windows using Groq Whisper

Pentagon Unveils New GenAI Platform, It Flags Hegseth's War Crimes

Immigration Agents Are Using Air Passenger Data for Deportation Effort

Realtime Interactive AI Videos

Meta's New A.I. Superstars Are Chafing Against the Rest of the Company

What kind of person is DeepSeek's founder, Liang Wenfeng?

Closures as Win32 Window Procedures