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?

CVS to Split Off Drugstore Business, Ending Its Bigger-Is-Better Era

Show HN: A table view for all your Trello cards

Get answers from what you save

I tricked decision models into thinking they were steering a real trolley

Hacker News Classics (2018)

Show HN: Edgepad – Turn an Android phone into a trackpad for your laptop

TB 26-09 Measured Hammer-Tap Inputs

The New York Times sues Brave web browser for AI scraping and bypassing paywalls

Asteroid defense hits a lump in the road

Kimi K3.1 Pro's open weights: 1.56 TB, MXFP4, and a $20M revenue license line

How to Tailor Your Resume for Every Job Application

Kimi K3.1 Pro writes fake OpenAI ciphertext

Single-neuron encoding of rapidly learned visual information reshapes perception

Ask HN: AI Coding Preference

How tall can you build with 54 Jenga blocks?

The blue wave is hammering data-center stocks on the prospect of more scrutiny

The Sequoia of Tomorrow

I built an alternative to Conductor for Claude and Codex

Candy Crush and Tech Debt

Show the Ramp

Teaching Students to See What They Miss

Bodum Recalls 5.9M Coffee Makers with Glass Carafes Due to Burn Risk

2026: The State of Enterprise AI

Oh suddenly Habibi search trending everywhere

Phone Harness: let your agent use your phone

HyperDrone

Google Says K-12 Students at Schools That Turn Off Its AI Tools Will Lose Search

Hosted Markdown 2 medium tool

The State of Python Profiling in 2026

Accelerating Engineering for the Physical World