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?

Google, Meta and TikTok sue California to block law protecting kids from harms

Ask HN: Clickwrap Agreements on a Tight Budget

Aspen: Self-hostable Git server for agent-scale traffic

Attackers Actively Probing for Upgrade-Window RCE Vulnerability in WordPress

Large-scale agent coordination for developers

MMX Mission to Phobos Faces a Gravity Challenge

Cua Driver Bench: can an agent use your computer without getting in your way?

Solomon Islands and Deep Forest's Sweet Lullaby

The Return of Flash Games

Google AI Saved Images Folder – Google Gemini

AI photo editing: Build on the editors we have instead of replacing them

Show HN: Church of Approximate Grace

Toadstools and Toxins

Answer iPhone calls on speaker in one gesture?

Linux 7.4-Rc2 Change Yields as Much as 162x Improvement for FAT32

Japan unveils emergency cybersecurity package amid data breach concerns

Developing histre with Vision: A Blind Programmer's Story

40C3 halfnarp – Submit talk preferences to aid scheduling

Show HN: Search Danish supermarket offers in English

Starship Telemetry Visualizer

We Know 15,579 Websites Are Infected. How Do We Tell Them?

Code Matters: Reflections on Rust in the LLM Age [video]

We stress-tested AI spend limits under bursts and outages

Screens, a Photo Collection

Palantiny, a thing that remembers every Bluetooth device that walks past me

Project Eve: Claude Plays MMORPGs

More Posts

Show HN: Should I Grade It? Estimates a Pokémon card's PSA grade from a photo

Software Twin of the Roland S1 Synthesizer with Automatic Differentiation

Cloudflare 10Q for the quarterly period ended September 30, 2026