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: The Only Prediction Market That Helps You Make Educated Bets

Fable 5 wrote a Windows kernel in 38 minutes

Porting Moebius 0.2B image inpainting model to run in browser with Claude Code

Music retailer sues Fender over C&Ds in Stratocaster copyright dispute

The Complete Kubrick

SpaceX turns to bond market to raise capital, reports $100.8B cash

Heritage sites are at risk in a warming world – and how to save them

Show HN: Nts – NTS Radio in your terminal

What it takes to get high Text-to-SQL accuracy in production

The Adobe Semaphore puzzle had been solved

Fatal Tesla Crash into Texas Home Now Under Federal Safety Investigation

The annotated PyTorch training loop

Sakana Fugu multi-agent system delivered as one model

At least 18 dead in France, including two children in hot car, as Europe bakes

The Technium: Why Are LLMs Smart?

PostmarketOS v26.06 (Alpen Avocado) released

We are witnessing the slow death of the prestige career

"ChatGPT is I presume broken"

Humanoid Robot Begs for Electricity Money on China Streets with QR Code

GLM-5.2 is above GPT-5.5 in new agentic knowledge work eval

AI Doesn't Replace On-Call Judgment

Not a Task Manager

Why eval startups fail (2025)

The PostgreSQL C Dialect

Trump signs executive orders to drive development of quantum computer by 2028

Server Survival

Ask HN: How do you make AI writing usable?

People around the world see a winner on AI – and it's not the US

The Value of Standards-Compliant Authentication

ContextMaestro – Curated Engineering Feed