Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Today Is CSS Naked Day

Rules for Ranking Music on the Hitmagist

Show HN: I made an app to live longer

Answer me – the bands visit [video]

What if you had to pay Claude as a human employee?

S3 Files

A practical guide for setting up Zettelkasten method in Obsidian

Rust Terminal Projects in 3 Years

DesigNet: Learning to Draw Vector Graphics as Designers Do

Blackdesk – open-source market research terminal (Go, TUI, local AI)

GitHub Availability March 2026

Rendering large code diffs in the browser without freezing the UI

Interpretable models with boosting, symbolic regression and e-graphs

Show HN: HoldMyBill – Organize Ownership

Show HN: UX Agent Mac app running continuously locally using Gemma 4

Tell HN: I know I dislike a developer

The First Bike Bell Designed to Penetrate Noise-Cancelling Headphones

Ask HN: What are you building that's not AI related?

AI company's breached biometrics, ID document images make deepfake fraud easier

Greece announces social media ban for under-15s over anxiety and sleep problems

I Built an Offline File Sync System

Tech industry lays off nearly 80k employees in the first quarter of 2026

Fears net zero is 'next Brexit' as oil crisis fuels political climate divide

Freestyle Ax Audit

New problem: AI finds too many bugs

Show HN: D3 4 Layer Magma Graph – Cloak Stealth Browser

Help Keep Thunderbird Alive

Lipovive – Optimize Mitochondrial Health and Burn Fat

Show HN: Chrome extension to filter HN comments by user karma/account age

The President Speaks Genocide