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?

The Hype Hangover Kicks In

Show HN: Flashback Booth, A tactile retro photo booth in the browser

Metamodernism: The cultural philosophy of the digital age

How Israel's AI surveillance breakthrough in Iran is reshaping global intel

Ask HN: How do you handle billing when event volume exceeds Stripe's limits?

Best YouTube Downloader Alternatives That Work in 2026

Phone-Free Events Grew 567% Globally in 2026, over 900% in US Alone

TimyWind Sailing Game

Snapcompact: SoTA Compaction – Instant, Local, Free. Pick 3

Identifying Life-Changing Books with LLMs

Formal Methods and the Future of Programming

Shareholder Supremacy and the Precog CEO

Ask HN: What would you do with a trillion dollars

The Future of Crossover

Thanks Amazon

Ask HN: If you had a trillion dollars, what would you do?

Show HN: Domainbase – Instant domain search and management

How cyber-criminals adopted Russias secret language of thieves

Mandrake –> Gentoo a.k.a. "Mandrake Expatriate Syndrome" (2003)

Sealed Super Mario Bros Sells for $3M Setting New Record for a Video Game

Show HN: Sessemi – Scraping API That Solves Cloudflare/DataDome/Akamai Itself

Kennedy Center Says It Has Removed Trump's Name from Building

Why India wants German submarines

The first trillionaire is a killer

Seasonal changes in human hair growth

Why greatness cannot be planned

What Happens to an Economy When It's Too Hot to Work?

Running DOS on Behringers DDX3216 with a DIY x86-Bios from Scratch

Something is jamming GPS over Europe. Here's what we found

Show HN: Deterministic and offline duplicate-code detector