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?

Dutch government objects to proposed US law restricting ASML's China exports

Classic – Hacker News

Twilight of the Velocipede: Typesetting Races Before the Age of Linotype

Google AI Overview – "Tersely"

Liquid Breathing

asp-classic-emulator: Run ASP Classic on macOS, Linux and BSD

Show HN: Artist Kit – One-Page Website Builder for DJs and Music Artists

I used AI to help market my bagel shop. Then the one-star reviews came in

Scenario with Low Demand for AI

How does your team capture decisions and action items after meetings?

AI Is Technology, Not a Product

Show HN: Firehooks – Get app users from TikTok without paid ads

Do Job Postings Show Early Labor‑Market Effects of AI?

BYD weighs Formula 1 role as 2026 rules shift toward electric power, VP confirms

Executives are blaming layoffs on AI, but it is not the main driver

Claude Agent View Changes How You Run Your Engineering Day

DIY Triboluminescence Media

The physics of scotch tape (2011)

X-ray and electron emission from peeling adhesive tape

Is Trader Joe's the "Quince" of Food?

Show HN: nbpipe – A lightweight workflow runner for Jupyter notebooks

Analysis of changes in the Bun codebase after the rewrite from Zig to Rust

Vulnerability Cve-2026-7412

Vulnerability Cve-2026-7411

Colleges got more rural students to apply, challenge is getting them to attend

Claude Session Manager – tile-based desktop manager for Claude Code

Too Much Is Happening Too Fast

Exploring Chemistry in Four Dimensions

Outcry: A four-layer activist AI that runs on a four-year-old phone

Local, reviewable repo memory for coding agents