Packed Data Support in Haskell

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

77•matt_d•7mo ago

Comments

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

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

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

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

cstrahan•7mo ago

No, one example of why being variable sized integers.

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

carterschonwald•7mo ago

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

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

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

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Nebula Awards Yelled at Until They Ban Use of AI by Nominees

Why Chinese Energy Projects Are Facing a Backlash in the Balkans

An amateur codebreaker may have just solved the Black Dahlia and Zodiac killings

Kimwolf Exposed: The Android Botnet with 1.8M Infected Devices

Oral History of Jeffrey Ullman [video]

Energy Predictions 2025

We Become What We Behold

Farewell, Bandhub. I will miss you (2019)

Old-school rotary phone dials into online meetings

Microsoft bets on AI to modernize Windows

Puzzle Designers Search for That 'Satisfying Click'

Context is all you need

Top MCP tools for software architects

Nature Programming Language

Exposing Honey's Evil Business Model Part 2 [video]

LLVM AI Policy and Automatic Bazel Fixes

Smokejumping

The Null Pointer Identity: Debugging the Architecture of the Chinese Self

Progress on the Digital Euro

On the rural Colorado plains, cancer patients rely on this traveling oncologist

Fuck You, I Won't Use Tailwind

Illicit economies, organized crime worsen Amazon deforestation in 2025

Writing Good Definitions Comes Down to One Basic Rule

Searching for Soul in Roblox

Jason Furman on the new economic data

The Debunking of Oliver Sacks

My Art of Accomplishment Retreat

Bari Weiss's Audience of One

Show HN: VibecodePrompts – Reduce prompt friction for vibe-coding

Show HN: TypeScript template for building ChatGPT Apps