Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

App Defaults in March 2026

Gorgeous DIY camera looks straight out of Severance

MXFP8 GEMM: Up to 99% of cuBLAS Performance Using CUDA and PTX

We Need Servers – Lots of Servers

Everyone Hates iPhone Autocorrect. An Update Fixes One of the Biggest Problems

Searching for the Perfect Sync

Volvo Infotainment Glitches Spark Class Action Lawsuit

Epic Lays Off Employee with Terminal Brain Cancer Who Cant Get LifeInsurance Now

Show HN: React-Rewrite – Figma for localhost that directly edits your codebase

The Socially Acceptable Use of AI in Business

AI-powered migrations from Postgres to ClickHouse

SparkID: Fast, sortable, compact unique IDs

GPT 5.4 sucks at front end

Portable MicroNeedle Fractional RF Machine

The Sudden Fall of OpenAI's Most Hyped Product Since ChatGPT

Pretext

How to Recognise Kentucky on a Map

Training the Idea Muscle

PyTorch Autograd and Mutation

Why Don't You Use String Views Instead of Passing Std:Wstring by Const&

Agentic Hive – Manage Claude Code and Codex Tmux Sessions from a Browser

RAM Bubble Popping?

How We Rewrote 130K Lines from React to Svelte in Two Weeks

Show HN: Real-time visualization of Claude Code agent orchestration

Will This 'Miracle' Battery Change Your Mind About EVs?

Seeing Trump Clearly

We audited our own AI-written codebase. 13 issues, 5 categories

GrapheneOS Refuses Age Verification, May Exit Regions That Enforce It

How Ants Map Social Identity

AI startups are eating the venture industry and the returns, so far, are good