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?

Shall We Repeal the Laws of Economics – Part III

Disrupting a coordinated model-distillation campaign

Christa Pike survives execution attempt after 2 injections

ESP-Mosaico a Modular Development Board Built for Coding Agents

AI CEO Interviews (2026)

The New Copilot with Home, Code and Autopilot

Office Question of the Day

Binjgb: Gameboy emulator implemented in C, that also runs in the browser

Meta wants people to use 'AI agents' to do daily tasks. Why that's a problem

Techwear

Natural General Intelligence

Let skills in Gemini tackle your most repetitive tasks

Programming the ENIAC(2011)

Stephen Fry: AI, a means to an end, or a means to our end? (Sep 2024)

OpenAI's Brockman Backs Out of Pledged $25M Donation to AI Super Pac

Show HN: Classican, listen + watch Classical music in a fun way

AWS just got a lot easier to use

Extended interview: Dario Amodei [video]

State of Pandemic Early Warning

Blast from Past: Nokia Presentation "Apple iPhone Was Launched"

The AI Pascal's Wager

Show HN: Miniagent – Free coding agent, no installation required

Online gaming companies investigated over in-game purchases

Should AI Be Open? (2015)

Show HN: Animated UI components you can preview and install in one command

Archestra-AI/OpenAPPA: Deterministic guardrails that don't break agents

PewDiePie announces his own Qwen 2.5 9B fine-tune [video]

Taylor mode automatic differentiation (jets) in PyTorch

A concrete explanation of how the internet works

Fitting Everything Together