Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Jane Street signs $6B AI cloud deal with CoreWeave, invests $1B

KeePassChi – Codeberg.org

Elon Musk buys a fifth of his own Cybertrucks

We're Hooked on Satellites. It Could Blow Up in Our Faces

Filling DOCX forms: GPT-5.1 broke it, every Claude model handled it

Lutnick's old firm pumps $10M into super PAC led by Tether executive

US, EU move toward landmark biometric data sharing deal

A privacy-first QR code generator (100% client-side, PNG and SVG export)

TCode: An AI Coding Agent Leverages Neovim and Tmux

Reed Hastings to Step Down as Netflix Chair

Frontier Coding Agents Built a Video Diffusion Pipeline on Max

Scientists Just Created Super-Strong Steel That Never Rusts

The Beginning of Scarcity in AI

Mechanical Sympathy

Neuromorphic Event-Based Camera Achieves Kilohertz Vascular Imaging

Accelerate building an independent European social web

Packrat Parsing at the Speed of Wasm [video]

Has New Music Become Less Popular?

Let sleeping CPUs lie: S0ix

JavaScript Promise.all() and Promise.allSettled() in Practice

GitHub Copilot Chat 0.44.1 – Possible Malicious Release

We Took $10k from MKBHD's Locked iPhone

Changing leafcutter ants' food reshapes their microbial gardens, scientists find

Sweden's schools cutting back on digital learning

Ask HN: Why Hasn't Clojure Caught On?

Estimating π with a Coin

Show HN: King Louie a desktop AI with 20 agent tools, no cloud required

The "Passive Income" trap ate a generation of entrepreneurs

Timeplus Released AgentGuard – Real-Time Security Detection for AI Agents

The Rise of Marketing Speak