Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•10mo ago

Comments

nine_k•10mo 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•10mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•10mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•10mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•10mo 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•10mo 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•10mo 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•10mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Why Expand Pax Silica? Building the AI Ecosystem of Tomorrow

Manitoba Moves to Outlaw Algorithmic Pricing–A First in Canada

Not All Malls Are Struggling

Broadcasters urge EU to tighten rules for Big Tech in smart TV standoff

Lumalabs Uni-1

Writing an LLM from scratch, part 32f – Interventions: weight decay

AI Token Economics: What Jensen Huang Is Building

SEC's ex-enforcement chief clashed with bosses over Trump cases before leaving

U.S. FCC Bans Foreign-Made Routers as a 'National Security Risk'

SEC's ex-enforcement chief clashed with bosses before leaving

Geo Cold Outreach in My Inbox Is Up 3x

Why Everyone's Picking Up a PSP Again in 2026

Can Good Writing Be Generative?

No, Windows Start does not use React

Obsidian CLI

Confronting the CEO of the AI company that impersonated me

Secret Hitler LLM Benchmark

Beyond AI Taking Jobs: When Economy Needs No Human Consumer

Cisco Announces DefenseClaw at RSAC 2026

Why your guitar goes sharp when you play hard: the Kirchoff–Carrier equation

Is ChatGPT a Scrabble Genius, or a Scrabble Disaster?

Python Software Foundation turned down Trump admin grant (2025)

Designing AI Chip Software and Hardware

Global Petrol Prices

AI boom risks widening wealth divide, says BlackRock's Larry Fink

Dusking is a trend aimed at helping people switch off at the end of the day

SynthVision: Building a 110K Synthetic Medical VQA Dataset

Gabbard plans to shift coveted, CIA-backed high-tech fund In-Q-Tel to her office

Philosophical DNA

Where Should the Agent(s) Live?