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?

Woolyss Chromium website shutting down 2026-08-31

Building a Korean ambiguity solver fast enough to skip the GPU: 7,300 words/SEC

AI and the invisible newcomer in open source

World Capitals Voronoi

Amid a flood of AI advances astrophysicists are questioning soul of their field

Ideogram 4.0

Amazon Cognito now supports multi-Region replication

Life – an artificial life simulation with Φ* integrated information

Show HN: OceanEye – an open-source interactive 3D atlas of ocean life

Show HN: Xa11y – cross-platform desktop automation via accessibility trees

France took the nuclear option to make Putin think twice

Meta AI Instagram Hack Wasn't About Authentication. It Was About Authorization

Applied Reverse Engineering Course

'The rich are living a golden age under Trump'

Introduction to nixidy – Kubernetes GitOps with Nix

Property-Based Testing

A Farmer Donated Land to Turn into a Park. The City Is Building a Data Center

Reading of OpenAI's Self-Improving Tax Agents

xAI is looking more like a datacentre REIT than a frontier lab

Show HN: Levi – run AlphaEvolve on your Claude Code/Codex for dirt cheap

"a game of court intrigue where AI simulates the various courtiers"

The Myth, the Mythos and the Man

Unhook, extension to block YouTube suggestion feeds, comments, and more

Diet Culture Ruins Lives

"Chat is dead": OpenAI preps overhaul of ChatGPT

Somalia: The way forward – fourteen years later

Biological Origin for the Ancient Alkanes Preserved in a Martian Mudstone

Alan Riding, Times Correspondent in Latin America and Paris, Dies at 82

Hayekian Literary Criticism

Spread