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?

Ask HN: What will AI coding look like for CS freshmen in 2029?

Show HN: Local-first LaTeX editor – open-source

Canadian government spent $46.8M on a secret Palantir contract

Sakana Fugu

Show HN: Free AI courses that require a short reflection to earn a certificate

Why the Human Genome's Tangled Physicality May Confound AI

Tlbic: A Time-Limited Basic Income System Designed with AI, v7.0

Staggeringly precise optical lattice clock has a wealth of practical application

Rights for Gods

Microbubbles in Medicine

Microsoft Activation Scripts – Activate Windows / Office / ESUs

Watt lies beneath (Geothermal Energy)

Josh helps Rust manage code across multiple repositories

My Opinion on RL

The Art of Kite Flying (1430–1929)

Show HN: Woltspace – a lodge for your coding agents

GitHub Banned All CI for Our (OSS) Org Because of Bad Drive-By Contributors

Americans and AI 2026: Chatbots, Smart Devices and Views on Impact

Rightwing populist 'El Tigre' wins Colombia election

Zombie unicorns are haunting Silicon Valley

Crossary – AI-assisted field mapping that outputs signed Excel files

Japan's Toto to invest $495M in chip materials, targeting 1-nm era

Never Too Late

Remaking BBC test cards to teach you video processing

Job application asked for my SAT scores

2k retired Google Pixel phones get a second life as a private cloud

Early prototype of Stonehenge unearthed 3 miles from prehistoric landmark

Keogram: The Sky in 2025

Entity Core Protocol

You're probably using Agent Skills wrong