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?

Medical AI scores high on exams but stumbles on real patient care

The Great Intermediary Panic

The Algorithm California Said Didn't Exist

Longevity medicine's do-or-die moment

Distro Fighter

Show HN: Self-Hostable Company Brain

Oligarchy is worse than you think

Self-Improving Agents Still Need Humans

Why Meta Suddenly Loves the Kids Online Safety Act

The Increasing Scarcity of Helium [2015]

Show HN: Pagecast – Publish Markdown/HTML Reports to Cloudflare Pages

Mars Is Spending Millions to Give M&M's a MAHA Makeover

Software is the only path to hardware

Don't Blame Plunging Birthrates on Phones

The Interplanetary Sciences Program

You don't understand, prices can't go down

Surprising Usefulness of Amazon's Quick Desktop

GSA Auctions

Intro to Peridot

Squidbleed (CVE-2026-47729)

Stop making swap partitions–use swap files instead

Lambda vs. Step Functions Execution Time

Show HN: Browser calls with live translation in the speaker's cloned voice

The smartphone's days are numbered. Meet the device that could come next

Eltif Reporting in Five Languages

Show HN: I Made TTSC, TypeScript v7 ToolChain for Plugins Like Typia

Show HN: Prompt Fusion Using Dags and OpenRouter

Glados for Claude

How Aspiring Autocrats Exit

Show HN: After years as data engineer, I built the tool I wish my colleagues had