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?

Show HN: Vibe code keeps running, even with the lid closed

You're paying for Claude's thinking and you're not getting it

Should coding agents have persistent understanding of a codebase?

Flight Over the Earth game (based on Google Maps)

Luxuries as an Adult

Halv used 51% fewer tokens per correct answer on SWE-rebench

Is AI ruining my brain?

Higher semaglutide dose associated with lower psych events ind. of weight loss

Blockchained

Spatiotemporal Composability and Cordis

Good AI Slop

StoryScope: Investigating Idiosyncrasies in AI Fiction

OKF Agent Memory – Git-native persistent memory for AI coding agents

Nvidia Lambda Circular Deal [video]

The Roadmap of Mathematics for Machine Learning

Show HN: Twinrun – run old and new code on the same inputs, diff the outputs

Falsehoods Programmers Believe About LANs

Breaking GitLab's GraphQL Layer: CVE-2026–19478 and CVE-2026–19650

AI push is putting banks at mercy of tech firms, warns Moody's

GPT-6 Astra: the harness is the product

An LLM runtime that boots from USB

Biomimetic SNN simulator in pure Rust (zero-deps, lock-free parallelism)

Nix: Life OS

Tyranny of Optionality

Apple's first foldable iPhone may cost $2k

Russian Drones Forced Ukraine to Park Its M1 Abrams Tanks

America's Two Largest School Districts Impose AI Moratoriums

Google AI turns on its maker in a brutally candid interview

Teaching Prevents Learning

The revolt of the reader