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?

First Time Filmed in a Decade – Underwater Volcano Eruption (Kavachi) [video]

Show HN: Frame-by-Frame Previews of MPEGs and PDFs (Rust)

NZ is using AI to take minutes and draft honours citations

Lawsuit Accuses Meta of Profiting from Widespread Fraud on Its Platforms

So This is Peak Smartphone [video]

The most overenginereed Chromium extension?

Ubuntu 26.04 is more than just a performance bump for thrill-seeking gamers

Reverse-engineering infrared-based electronic shelf labels

Rivian R2 won't have A/C buttons followed by CEO's decision

1981 Spanish cooking oil disaster

Zero Days Clock

Paraloid B-72

Five Simple Steps to Fix America

The Dangers of Nicotine Biohacking

GPT 5.5 Released in Codex

An Algorithmic Reconstruction of Normalisation by Evaluation

Global energy markets are on the verge of a disaster

Moving a tenant across PostgreSQL instances

Can EVs kill off petrol cars in China?

Code, your choice: Netlify's stance on AI training data

Changes to GitHub Copilot Individual Plans

Bob Dylan – Murder Most Foul (Official Audio) [video]

The Mattering Instinct: How Our Deepest Longing Drives Us and Divides Us

OpenBSD – LibreSSL 4.3.1 Released

Elon Musk's SpaceX Endgame

The State of the Human Rights: April 2026

Hundreds trying to storm Wisconsin beagle research facility

Happiness Feels

Microsoft's GitHub grounds Copilot account sign-ups amid capacity crunch

Ask HN: What Would Make Stack Overflow Great Again?