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?

Discovery of capability overhangs via wiki writing

Brain scans reveal how to enters a psychedelic-like trance without drugs

I built an autoresearch loop for performance engineering (27% speedup hashtable)

Black Hat USA 2025 – HTTP/1.1 Must Die the Desync Endgame [video]

Cuneicode - Exact rational arithmetic. Quantum computing stdlib.

The secrets of black holes and the Higgs mass could be hidden in a 7D geometry

Mirror's Edge Early Prototype (Feb 7, 2008) [video]

Isseven

Heavy Wizardry 101 Official Repo

Ask HN: Will AI agents replace data scientists or make them better?

Mission to Recover Downed F-15E Aircrew

Evacuation of U.S. troops from Mideast base sends community groups scrambling

Some Thoughts on AI and Research [pdf]

Efficient biosorption of nanoplastics by food-derived lactic acid bacterium

Hackney

Shooting down ideas is not a skill

Take-Two seemingly laid off a portion of its AI team, including head of AI

Microsoft Discontinuing Publisher. Alternatives?

Show HN: Contrapunk – Real-time counterpoint harmony from guitar input, in Rust

Show HN: Vibooks – Local-first bookkeeping software built for AI agents

Adjectives from the Future: The Dangers of Result-Based Descriptions (2019)

Extrapolating From Existence: Is it surprising that we exist now?

Dr. Dobb's Developer Library DVD 6

Post-Penultimate Conditional Syntax

OpenClaw and Claude Is Now Pay-per-Token: What It Costs and What to Do Next

After the Mercor breach, I built a local secret scanner for AI-generated code

Snap as the Canary: Why Every Streaming Platform Should Be Watching This Trial

Search Google for "Greek Alethia"

Delve claiming that whistleblower was part of a "targeted cyberattack"

The decade long feud shaping the future of AI