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?

Natural Independence Incentives

Successful first‑stage recovery of the Zhuque‑3 rocket

Building high-performance flat 2D arrays in Rust (SIMD, L1 Cache)

Market Close data in an easy to read email

Show HN: MatrAIx – simulate users before reality (Survey/Chat/Web/App)

Whistleblower Arturo Béjar leads testimony in landmark trial against Meta

Zuckerberg encouraged growth over child safety, ex-Meta executive testifies

Micron and the Myth of American Memory

Do We Still Need Database Management Tools When AI Can Write SQL?

Editing Text with a MIDI Controller

Evaluating DeepSeek V4 Pro 0813 on Hack the Box Challenges

The box that built globalisation

California lawmakers call for crackdown on wildfire betting

Show HN: AI agents can now safely write to your CRMs

Show HN: Tempo Checker – Real-time disposable email detection API

Ask HN: How do I get Fable to acknowledge me?

How Claude's Watermark Works

Show HN: HN Notify

Copycat

Microdramas boom in a shrinking Hollywood as studios chase a TikTok audience

Serum 2 Synthesizer plugin gets Linux support

The Life and Times of Maxis, Part 3: The Sims

Comparing Qwen3.8 Max and Fable 5 on UI

T-Mobile 'chopped a cable' to expel Chinese hackers from its network

Bongard Problems

The Sun Never Sets on the Ant Empire (2019)

I wanted to talk to a turbine, so I spent 18 years building NthDimension

The Rats Terrorizing Everyone in Gaza

Ask HN: What are folks using as the storage engine for their context graphs?

Why Outdoor EV Charger Displays Are More Complicated Than They Look