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?

Is CPU design hitting a (soft) speed limit?

Real-Time NYC rat map

Optique 1.1.0: Command discovery, value parsers, and ordered grammars

Phoenix mostly doesn't drink Colorado River water

Note on Rio 3.5 Open

What one country's experiment says about attempts to boost birth rates

I built a notes app powered by the model that powers Apple Intelligence

Ask HN: What was the last thing you built on Fable 5

In the Matter of OpenAI vs. LangGraph (2025)

DOJ Lawyers Argue xAI Is 'Vital' for National Security in NAACP Lawsuit

EU AI: the fables we told ourselves

ShopFoundry – Turn Etsy listings into better titles, tags and descriptions

Distro Fighter game: Find your Linux distro and desktop

Age Verification in Monolith OS

Safety Ideas, and a Testable Path

AI efficiency gains come at a high energy cost

Predictive Data Debugging: Reveal and Shape What Models Learn Before You Train

Frederic Tudor

How Many Elementary Particles Are There, Really?

Hardest IT roles to fill in 2026 and what's changed

Leaked from Russia: 18 Videos of the Fuel Crisis Growing Fast [video]

A weekly read on the US hay market

Microsoft turns to AWS as GitHub faces AI capacity crunch

Anthropic Sued over Alleged False Advertising on Claude Max Subscription Limits

6th Finger Project (2022) [video]

Australia to probe assault claims by Gaza flotilla activists against Israeli[..]

Library

San Andreas fault reaches highest stress level in 1k years

Microsoft Teams introduces office attendance tracking via Wi-Fi

Vance: Iran can have access to $300B reconstruction fund