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?

Going Founder Mode on Cancer – By Elliot Hershberg

Substantial under-detection of human rabies cases in the United States

How to work remotely from France: the 2026 visa guide for digital nomads

Claude Skill – sourced research on how 5 social apps work

4000-Series Integrated Circuits

Pyramid Replacement

USDA cyclospora research projects shelved amid funding cuts and relocations

Flock's CEO Is Lying to Cops About 404 Media's Reporting on Abortion Case

Qbittorrent OS: a Buildroot-based qBittorrent VPN appliance

Pimacs – An Emacs UI for Pi

Should we laugh more at ourselves? It's complicated

Redesigning the Inference Chip

Show HN: Randomly Sample Locations on Streets

Cross-class friendships are strong predictors of upward mobility

Should We Have Kept the American Empire?

Ancient 'Who owns Linux?' case now has one foot deep in the grave

Monetizing the Golden Age of Short Selling

Show HN: Flint – A C/C++ build system and package manager written in pure C

Show HN: Tinysandbox-JS-Runtime - JS in WASM in v8

Seattle light rail became first floating passenger train

Coyote vs. Acme (also, for free, my take on The Odyssey)

The baffling science of SSRIs: how do they work?

Who Are We Now?

Reward Guided Speculative Decoding

'They shot all their weapons; they trashed their ships; they ran out of money'

Revise, a zero code, desktop ML platform, revolutionizing ML model creation

Show HN: AbracadaNames – a multilingual, data-driven wall of first names

Superhuman AI coding still makes software worse

Anubis' Design

Debian: Retiring from the Project (Vv221)