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?

Climate ranks 14th on list of top issue for the midterm

Terabytes of credentials leaked in supply-chain attack

We built a Ferrari RevOps engine in a Latvian garage

Hackers steal over $130M by exploiting bug in offline hardware wallets

Burnout in Open Source

Intel wants to integrate DRAM with the CPU [video]

Foreigners can now move to the US if they buy a Trump Gold Card

Show HN: Quicly – SRT in, live multiview in one iframe (Media over QUIC)

Seven Obscure Languages in Seven Weeks

An Android launcher with no icons, and an eBook above the clock

Crisp's chat widget refuses to load when Lighthouse is the user agent

Like Before, You Can Go Breakneck Speeds and Make Mistakes

Ya Diktu: The Pre-Print from the AI Engineer Who Cracked Linear A

Rust fearless_SIMD v0.7: 64-bit integers, improved generics, SSE2, and upcoming

AANE – Local data-broker profile poisoning engine

I asked Kilo to delete my data, and they practically told me to fuck off

Delimiter.live – 100 free browser-based text and data tools

Ticketry: Jira alternative, but with all the data in Git

Our scheduler is so fast it can rickroll you

Js13kGames 2026 started – build a web game in 13 kilobytes

Japan has recorded its ten most popular baby names every year since 1912

Python's pre-declared constants are kinda weird

Sergey Brin has spent $100M to fight California's proposed billionaire tax

Homelab Ingress with Deterministic IPv6

From Weak Cues to Real Identities: Evaluating Inference-Driven De-Anonymization

The Quest for Caffeine You Can Have at Night

Booksellers suspect AI firms are buying and then destroying rare books

Yardmaster – manage multiple Claude Code sessions from one terminal

Reduce large sorted set memory with a packed B+ tree

Show HN: Markleft – how I review Claude's Markdown plans