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?

Cachebox

California's landmark anti-plastics law sparks anger as 17 states move to sue

Show HN: A REPL for browsers that agents love

The dordolec, the 'evil eye' and superstition in Albania

The Fake Pilot (2010)

The making of the digital twin of the Panorama of the Battle of Murten

GPT-5.6: The System Card

City counsellors under fire for AI Orange Line map [video]

'Crypto vs. community': local US lenders join forces to fight 'stablecoins' law

Clean GitHub repo tricks AI coding agents into running malware

What is your most fascinating tech used in Formula1(F1)?

Michigan bill would bar employers from requiring after-hours coms with workers

5k Restaurant Menus, Years 1880-1920

Show HN: I built an AI fence visualizer

Are there any features modern Anime AI lacks

Report on the State of Scholarship in the Humanities [pdf]

EU to legislate about Chat Control behind closed doors

Build Your Own IP Geolocation Setup Without the SaaS Tax in an Afternoon

North Korea dictator Kim Jong Un is illegitimate because his mother was Japanese

Flock cameras track more than your license plate, and they're spreading fast

In the AI era, be a builder or a seller, not a measurer

Show HN: Clanker TV

Show HN: A live (natural language) interpreter / translator

Who will be the senior engineers of 2036?

Global recession and the end of the middle class: What 'AI exuberance' could do

Dependently typed Clojure DSL with a Lean4 compatible kernel

Reinforcement learning towards broadly and persistently beneficial models

What Happens When You Delete the Pauses from Your Day

Claude Code turned every engineer into three. Now companies need more PMs

Our Favorite Reddit Apps for Android in 2026