Packed Data Support in Haskell

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

77•matt_d•12mo ago

Comments

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

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

Zolomon•12mo ago

They mention this in the article.

spockz•12mo ago

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

cstrahan•12mo ago

No, one example of why being variable sized integers.

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

carterschonwald•12mo ago

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

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

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

lordleft•12mo ago

This was very well written. Excellent article!

NetOpWibby•12mo ago

Is this like MessagePack for Haskell?

Monthly Roundup #41: April 2025

Google Uses Cox Ruling to Kill Last Copyright Claim in Textbook Piracy Lawsuit

Show HN: I built a systems programming language (Tin)

Is it easy to build advanced AI features on SSE?

The Industrial Space Needs to Be Braver

Show HN: Music from Your Git History

Show HN: I made a website to clean up recipe websites

The Industry Decided to Harvest Users. I Decided to Build for Myself

Let's Talk About the Time the CIA Kidnapped Lunik

The Books That Take Revenge, Centuries Later

The Podcast Where You Can Eavesdrop on the A.I. Elite

Constantine: Locates Fatal Security Bugs in Software

1Password Is Down

First DeepSeek V4 Flash-Base-Int4 Quant

Dutch central bank dithces AWS and chooses Lidl for European Cloud

I analyzed 571M Amazon reviews to find the most profanity-filled customer rants

Lean Game Server

OpenAI has updated partnership with Microsoft, services will be cross cloud

Show HN: I spent 5 years building a financial planning and optimization tool

Antennagate

A Man Behind AlphaGo Thinks AI Is Taking the Wrong Path

How Meetings Got Cheap and What That Cost Us

SHOW HN: Dev Notes++ is the companion app for indie devs to track bugs, ideas

Developers, Beware of Intel Core Ultra Series 3 (a.k.a. Panther Lake) Processors

Show HN: Prediction market analysis app layering LLMs with data APIs

PgBackRest is dead. Now what?

Anthropic created a test marketplace for agent-on-agent commerce

UnixPC – Why did it fail?

Ten People Are Quietly Deciding How AI Agents Will Prove Who They Are

From "What the Fuzz?" To "All the Fuzz " (Keynote Fuzzing Workshop NDSS'26)