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?

City Chicken vs. City Chicken: Berlin's Bloody Rotisserie Feud

Avalanche's desktop fusion reactor delivers blistering-hot plasma

An Interview with Jen Schreiber (2025)

Show HN: strangeClaw – a self-hosted agent running inside a Firecracker microVM

Tell HN: Stack Overflow seems down

My Journey in Open-Source Library Development

Summary of recent buggy Kindle updates since Nov 2025: dictionary, fonts, manga

Reusing code can be a sunk cost fallacy in the LLM era

The Last Evolution, by John W Campbell Jr. (1932)

Show HN: Building a Resume ontology and tooling for LLMs CV management

Show HN: Rscrypto 0.4 treats constant-time as a release gate

Fable will NOT help if it thinks your ML research/ML engineering is interesting

Beyond Platforms and Protocols

Execution Feedback Matters More Than Pipeline Topology in 1-3B Code Generation

Elon Musk accused of fuelling unrest after Belfast knife attack

Show HN: Chip's Challenge (1992), rebuilt for the web

The .at domain registry is threatening to send debt collectors (2013)

.NET 11 Preview 5 is now available

The Design of Display Processors (1968) [pdf]

Ask HN: The next evolutionary step in LLM usage?

Ask HN: Should the term "cognitive surrender" apply to writers who publish slop?

Show HN: HelixDB – A Graph Database built on Object-storage

Barry Diller says MGM's physical assets are more valuable in AI age

Show HN: See what your AIs know about you that the others don't

Foil

Anthropic releases 'safe' version of Claude Mythos AI model to public

Everything Is Recorded Now

China's BYD aims to be biggest car firm within five years

Siri AI Is a Malware Vector

Show HN: Knobkit – fast ai webapps; fully in-browser or on a stateless server