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?

A 481-meter-high landslide-tsunami in a cruise ship–frequented Alaska fjord

Robot Brain for Smol Brain

Optimizing Memory Access in NIR

The Serial TTL connector we deserve

Internet Archive Outage

Twilio SMS gateway outage: 2FA affected globally

Show HN: Coding agents can control desktop software without MCPs

A Cursor AI agent wiped PocketOS's production database in under 10 seconds

The Self-Cancelling Subscription

Kalshi, the Prediction Market, Is Now Valued at $22B

xAI built an illegal power plant to power its data center

Why do LLM outputs get worse even when metrics stay stable? [pdf]

Goldfish Scheme

Ask Gemini: "How do I get the first item from a list?"

API Keys Get Leaked in 2026 (and You Won't Notice)

Show HN: BrowserCode – Run Claude Code in the Browser via WebAssembly

Lisp in Web-Based Applications (2001)

Intel's Larabee Legacy

curl.md – URL to Markdown for Agents

Kavun, embeddable scripting language for Go

Personal finance with Laravel – Free course

Head of Claude Code on the future of work and productivity [video]

Remarkable Paper Pure

Origins of Python's "Functional" Features (2009)

The HTML Sanitizer API

The map that keeps Burning Man honest

A representation model as a workaround for catastrophic forgetting in LLMs

LCM: Lossless Context Management

The River Otter's Remarkable Comeback

Show HN: After 15 years of lifting and spreadsheets, I built my own workout app