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?

Ball Simulator in Python Made with Claude

Google's Own AI Researchers Jockey for Access to Its Computing

Have I Been Pwned: Colombian fintech company leaks 34.5M accounts in March 2026

Do Androids Dream of Your Electric Life?

Language Registries Are Unstable by Default

Retrospective on DDIA

The American Rebellion Against AI Is Gaining Steam

New features in GCC 16: Improved error messages and SARIF output

A shallow dive into formal verification

Reverse Lookup and AI-Powered Osint

The Coming Food Crisis in South Asia

The last six months in LLMs in five minutes

Surface owner loses their limited 50th Anniversary edition after a repair swap

Nitsum: Serving Tiered LLM Requests with Adaptive Tensor Parallelism

SuperInfer: SLO-Aware Rotary Scheduling and Memory Management for LLM Inference

What can a local model do for you in early May 2026?

Guess where someone works based on their profile picture

Sony Pulls Back from PlayStation Games on PC

Museum of Innocence (Museum)

Video GTP

BudgetBites – AI meal planning app that helps you save money on groceries

Make products AI agents want

Google, Blackstone plan AI cloud venture with $5B backing, WSJ reports

We should stop using Agile and Waterfall as is

Feedback on my S&P 500 Search Tool (fast search by name, ticker, sector)

Will the Indus Valley script ever be deciphered?

May I recommend eww for Emacs's innovative UI?

Google and Blackstone to Create New AI Cloud Company

Self-Hosted Web Application for Displaying and Interacting with KiCad Projects

An Apple (II) for Teacher