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

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

cstrahan•9mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

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

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

How to build OpenClaw in 400 lines of code

Tour Guides Accused of Scamming the Louvre Out of $12M

Berkshire Hathaway reduces Apple stake as Warren Buffett officially retires

Show HN: TableCraft – Stop burning AI tokens on table boilerplate

What can our thoughts reveal about the nature of consciousness?

Idea: Medbook and Other Ideas

Advancing independent research on AI alignment

Have you tried Turing it off and on again?

DOGE Bro's Grant Review Process Was Literally Just Asking ChatGPT 'Is This DEI?'

Emulating Goto in Scheme with Continuations

Show HN: Maravel-CRUD-wizard-free lib suite got new speed improvement

Why Europe doesn't have a Tesla

The Rust Strawberry Test

Show HN: Rememex – Semantic file search that runs 100% locally (Rust/Tauri)

Taalas Specializes to Extremes for Extraordinary Token Speed

What we think is a decline in literacy is a design problem

Show HN: Full-stack type-safety from go to TypeScript with Hot Reloading

Do the people building the AI chatbot Claude understand what they've created?

Bill Gates cancels AI summit address amid fresh scrutiny over Epstein links

A terminal weather app with ASCII animations driven by real-time weather data

Analysis of 9k OSS PRs: merged PRs have half the AI-slop rate of open ones

Asymmetric Emotions and Economic Preferences: Dread, Savoring, Risk, and Time

Show HN: Give Agents Isolated Linux Sandboxes via MCP [Kilntainers]

Great SaaS dead or alive read

Armchair Detectives Complicate Nancy Guthrie Case

Ivan Zhao on X: "On Universe, Life, and AI " / X

SheepCat – An open-source tracker for executive dysfunction

AI Critics Don't Use Claude Code

Show HN: Fast and lightweight hash implementations (xdigest)

EloPhanto – self-evolving AI agent