Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

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

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

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

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

cstrahan•9mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

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

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

Companies reap $22B from Trump's immigration crackdown

JautBook – AI Reddit

Crypto wallets received a record $158B in illicit funds last year

A Firefox Android extension for YouTube background play

Don Lemon Released Without Bond over Minnesota Protest Charge

Show HN: Moltbook Overtaken by Shellraiser

Show HN: Free Text-to-Speech Tool – No Signup, 40 Languages

What ICLR 2026 Taught Us About Multi-Agent Failures

Hawaii Deepfake Election Law Is Unconstitutional, Court Says

Humans Welcome to Observe

SQLite WebAssemby

New York Congestion Pricing's Unexpected Winners: Suburban Drivers

January 2026 Links

My Weekend Project Rentmyheader.xyz

Pi: The Minimal Agent Within OpenClaw

Show HN: Bunnie – Use Bun as the templating engine in Rust applications

Finality does not exist in payments (2022)

The Math of the AI Bubble (A 2027 Forecast)

Large-scale, high-quality, and diverse muli-round dialogue data

Nvidia's 10-year effort to make the Shield TV the most updated Android device

Manual Programming

How should businesses respond to rising energy rates? (2025)

The rise (and future fall) of Discord

Is Time a Fundamental Part of Reality? Quiet Revolution in Physics Suggests Not

Ctlsurf – A notebook that forces AI coding agents to document their shortcuts

Moltbook Source Code

BotMaker: Simple Openclaw Configurator

Astrological CPU Scheduler with eBPF

The Hairy Ball Theorem by 3Blue1Brown

Synthetic datasets where failure emerges from dynamics, not labels