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?

AI will not replace software engineers (hopefully)

The Essence of Frigidity

Graphic tip: rounded rectangle borders (2006)

An unsolved question in sleep science

Exams Are Everything in China

Thinkism

Interview with Yayimhere

Clairtone's high-end hi-fi system was prized by celebrities and musicians

When Music Stopped Mattering: How optimizing for attention broke everything

OSS ChatGPT WebUI – 530 Models, MCP, Tools, Gemini RAG, Image/Audio Gen

Escorian.com: match with political candidates based on ideologies

My answers to the questions I posed about porting open source code with LLMs

I Want to Use LLMs in 2026

Apple AirTag

New-wave reactors: The face of an American nuclear Renaissance. Experts alarmed

My first contribution to the jj project

Considering Strictly Monotonic Time

Web app to send files to devices on your Tailscale network

Optimizing Python Scripts with AI

Trump Action Tracker

Visualizing Rectified Flows

Why all AI coding startups get pricing wrong

Porting Doom to My WebAssembly VM

Why Startups Still Choosing Rails Are Betting Against the Future

What do we mean when we talk about pollution and toxicity in online spaces?

Exactitude in Science – Borges (1946) [pdf]

There's no dark mode on your dollar

Television is 100 years old today

China figured out how to sell EVs. Now it has to deal with their aging batteries

Built a way to get simulated feedback before launch