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?

Scoop: White House monitors suspected plague outbreak in Russia

Annotated Finnegans Wake

Fallstreak Hole

Show HN: MapLibre Compose, Interactive Vector Maps for Compose Multiplatform

Repair Café Silicon Valley

blob camera

What new cat ownership data says about Americans

Recly – turn your watch into a Plaud-style AI recorder

Gold Steadies as Softer Inflation Cuts Fed Hike Bets

Full-fabric VHDL LLM inference engine. Runs Qwen3.5-class transformer inference

The Unspoken Arithmetic of the Alto Line

Let's compete with China on AI social impact

Linear Exponential Scaling in Non-Abelian Groups: A Universal Map

Iran is going after America's debt it's targeting the $40T America owes

We Built an Independent DNS Cache Edge

Google freezes open-source bug bounty program amid flood of invalid AI slop

How many humans does it take to make tech seem human?

Show HN: Mathness – printable math worksheets, pre-K to grade 5

Live vote counting for Brazilian Presidential elections

Your Right to Privacy Doesn't Disappear When You're in Public

AI is making ambition feel pointless [video]

Asteroid-mining company to launch first autonomous space mission in 2027

Mellon Foundation Releases the First National Study of Community-Based Archives

Memelang: Token-Terse Query Language

Remote-Jobs-Api.tten.no

Show HN: Web Analytics Focused on Revenue

The Inner Worlds of Neon Genesis Evangelion

Google Tells Sites to Fact-Check AI Content Before Publishing

Local models on 27,489 CVEs: 4.2% omit security impact (ex-kernel)

Show HN: Native Rust rewrites of Electron apps, starting with Slack