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?

Moving Past Bots vs. Humans

I made a research test suite for analysis of software metrics overtime

Why Are Palantir and OpenAI Scared of Alex Bores?

Designing web interfaces with Claude Code

Better (Free) GitHub Readme Widgets

The Luddites Were the First to Attack AI

Is your site agent-ready?

CrabTrap: An LLM-as-a-judge HTTP proxy to secure agents in production

FlashKDA: High-performance Kimi Delta Attention kernels

Firefox 150.0 Release Notes

Age verification is officialy TRASH

The 'unregistered Americans': because of their parents, they do not exist

The layer that helps machines understand why, so they can act without being told

Capture and replay Postgres workload at scale

The cost for posting links using X's API increased today by 1900%

Termux vs. Terminal on Pixel 10

Exposing the flaw in tap to pay [video]

How is the world doing today?

Emacs Is My Browser

Finishing Things

Why "mark your variables as sensitive" is the wrong lesson from the Vercel hack

The AI engineering stack we built internally – on the platform we ship

Alex Bores rolls out "AI dividend" plan to share AI wealth

Regula – scans your code for EU AI Act risk indicators (Python CLI, MIT)

Sweden Orders Talgo Nighttrains

You can make something good

Thiel Foundation Announces 2026 Class of Thiel Fellows

Chinese diamond-based coating boosts data center cooling efficiency by 80%

China blew up its own future [video]

Azure SRE Agent flaw lets outsiders silently eavesdrop on cloud operations