Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo 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?

FreeRadical – Rust CMS that's 1500% faster than WordPress

NYC phone ban reveals some students can't read clocks

Nike's Crisis and the Economics of Brand Decay

Show HN: AceIQ360 – First AI memory system to achieve 100% on LongMemEval

Karpathy on Programming

Bioinspired wettability boundary stabilizes water sloshing

I got sick of keeping scraped data up to date, so I built this

Don Knuth – Christmas Lecture 2025 [video]

Calcutta High Court questions IndiaMART exclusion from ChatGPT results

ExpertMouse TB800 EQ Trackball: Listening to Our Users

I Build Trailonix Because Logging Everywhere Sucked

Show HN: The Epstein Library

LLM Sycophancy: The Risk of Vulnerable Misguidance in AI Medical Advice

Nvidia is buying Groq for reasons imo

Apple's brain drain in post-iPhone era proves it can handle Executive turnover

China Sanctions Boeing, Other U.S. Companies over Taiwan Arms Sale

Data Center Surge Reaches India as American Tech Giants Invest Billions

America's Biggest Oil Field Is Turning into a Pressure Cooker

Show HN: GrainJS – a light TypeScript web framework

Next Year Is Americas 250th Birthday. Meet the Person Behind the Celebration

Russia patents space station designed to generate artificial gravity

What on earth is Kubernetes? (a beginners intro)

My role as a founder-CTO: year 8

Ban LLMs Using First-Person Pronouns

Show HN: Historical Options Chain Data for 100 US Equities (2008–2025)

Notes on Building an Internal Agent

Cursor UI is built with SolidJS

Show HN: Real-Time Website Generator

Code a database in 45 steps: test-driven coding puzzles

Joyce Project