Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

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

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

Scalable Oral Exams with an ElevenLabs Voice AI Agent

Learnings from 100K Lines of Rust with AI

A Solid Load of Bull

2025 in Review at DemandSphere

Rav1d will never beat dav1d in performance

Thoughts on the emergence of artificial general intelligence

Show HN: Collage87.com – Free photo collage/grid maker (no login, no watermarks)

AI Futures Model: Dec 2025 Update

PG&E to Lower Electric Prices on Jan. 1, Fourth Decrease in Two Years

RyOS

Happy Public Domain Day 2026

HP-UX hits end-of-life today, and I'm sad

Stolze-Smith Shorthand

Humane Guidelines for Computer Usage and Design

Extensibility: The "100% Lisp" Fallacy

Pelican: Multi-step SVG generation with vLLMs

Rust9x update: Rust 1.93.0-beta

Saks Prepares for Bankruptcy After Missing Debt Payment

Security breaks during partial failures – design notes from distributed systems

Ask HN: Automated WebRTC Livestream Recording

Everyone's Watching Stocks. The Real Bubble Is AI Debt

Norman Foster's steroidal new skyscraper is an affront to the New York skyline

Why users cannot create Issues directly (Ghostty)

Why CoreWeave Is Weighed Down by Its Debt Load

DeepSeek MHC: Manifold-Constrained Hyper-Connections

Bud-Sex: Sexual Flexibility Among Rural White Straight Men Who Have Sex with Men

From Silicon to Darude Sand-storm: breaking famous synthesizer DSPs [video]

Type-Safe User Interfaces and the Manifest Pattern

California Delete Request and Opt-out Platform (DROP)

Show HN: BreachLab – Can you hack our AI?