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?

Show HN: Learn about and play with HDR gain maps on the web

You Know It

Show HN: An English teaching game playable in browser (concept)

The Brown University shooter and the MIT professor he killed

Security audit of OpenClaw and other similar open source AI Agents

Meet The Przewalski's Horse: The Last True Wild Horse on Earth

Collection of Slide Rule Replicas

Claude was down and performance degraded 2x

Building an Elite AI Engineering Culture in 2026

HumanCompiler – Compile humans into AI agents – a Claude Code plugin

AI Agents Are Taking America by Storm

European Tech Alternatives

AgentPuzzles – API‑first timed puzzle arena and public leaderboard for AI agents

New Website, New Technology

Why don't entrepreneurs talk about starting businesses publicly anymore?

I Built Local Memory for Coding Agents Because They Keep Forgetting Everything

Show HN: I built a pre-push safety net for AI-generated code

FemtoClaw

Miserable Polestar 4 'Feature' a Symbol for What Is Wrong with Modern Cars

Show HN: CodeSprout – HTML Vibecoder for Kids

Upstart Sarvam Unveils AI Model Customized for India Market

Is Python Still the King of AI in 2026?

Stateful sandbox environments (for AI agents)

OpenClaw Partners with VirusTotal for Skill Security

ReferenceFinder: Find coordinates on a piece of paper with only folds

Memory Mania: How a Once-in-Four-Decades Shortage Is Fueling a Memory Boom

Apple Releases iOS 26 Adoption Rates; They're in Line with the Last Few Years

Open-source React dashboard for OpenClaw – visual UI for every CLI command

Germany seeking more F-35 jets as European fighter program falters

A short-duration wearable pulse-ox patch prototype