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?

Closed City

Show HN: Critter TUI for reviewing GitHub PRs and agent changes

Why Doctors Hate the Internet (2000)

Grand jury finds DeSantis administration "misappropriated" $10M

Instinct is raising a $250M Series B

First patient to undergo live AI-assisted brain surgery has tumour removed

Roast My Startup

Japanese avant-garde artist Yayoi Kusama dies aged 97

2026 Nepal Floods

The Self-Hosted SSO Tax: A Verified Tracker

Ask HN: Do you think tariffs are about anything other than creating inflation?

Apple Maps Launches Ads on iPhone

Dissecting the Apple M1 GPU, the End

Meta's self-inflicted resignation-wave

48 Node B300 cluster live in 3-5 weeks

What Is a "Jeopardy "-Worthy Computer (2015)

Why China is suddenly betting on e-fuels [video]

Show HN: Sift – a cross-platform Snaffler replacement

How researchers are teaching AI to learn like a child

Show HN: Check if your OTP/verification SMS or email arrived

Show HN: Wattage – finds the tokens your Claude Code sessions wasted

Meta Just Paid Nearly $17B to Write the Kid Safety Rules for Every Platform

FrankenMermaid. A deterministic, memory-safe Rust implementation of MermaidJS

Show HN: CloudDM – One more small step toward safer database operations

GoodSaaS – Discover useful SaaS products without the noise

Ask HN: Do you also notice CNN's poor English?

PiLFS Linux from Scratch on the Raspberry Pi

Tragedy of the Commons

Humanity has the debate about AI consciousness backwards

Keep an Eye Out on Chromium's Flatpak Experiment