Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•9mo ago

Comments

nine_k•9mo 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•9mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•9mo ago

They mention this in the article.

spockz•8mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•8mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•8mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•8mo 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•8mo 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•8mo 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•8mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

Shark attack truth: Why experts won't admit population boom

The 2026 Linux Summer Games [video]

Yat Another HTTP Proxy Analyzer

ICE flew 2-year-old to Texas despite court order to release her from custody

Nvidia and Linux, a Question

Europeans Can Turn 2 Car Seats into 4 Child Seats, but It's Illegal in America

Need Feedback for Idea

"People are going to stop and ask you, 'How can I help?' Let them."

NASA about to send people to the moon – in a spacecraft not everyone thinks safe

Have We Been Wrong About Language for 70 Years? New Study Challenges Theory

Health insurance execs shift blame for costly, confusing health care system

Get Shit Done

Fuggerei

Ask HN: How are you enforcing permissions for AI agent tool calls in production?

Caroline Ellison Former Alameda CEO Released from Prison After 440 Days

The Epic Survey of Mason and Dixon

Agency Recruiters can sell retained searches

Turn any developer into a low performer

Agents.md as a Dark Signal

December in Servo

Ditching Flickr for Immich, Protecting My Kids

A new direction for students in an AI world: Prosper, prepare, protect

AI can 10x developers in creating tech debt

Why a God Can't Play a Link to the Past [video]

Show HN: A simple algorithm for shifting solid-color image backgrounds (WASM)

Customer growth is slow. Who do I talk to?

The End of Discovery?

Show HN: Flux, A Python-like language in Rust to solve ML orchestration overhead

Python's `json.tool` Utility

AI agent generates rebuttals for papers