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?

Disney+ removes 4K and HDR from premium plans in Germany

Fcgc

Packaging Companies in Sri Lanka

AgentEnv

Show HN: Kimi K3 Is Now Live on Canopy Wave

Show HN: WhimPop – A macOS menu that pops up under your cursor

Show HN: Turo – Tagalog for point, saves Tokens by pointing instead of talking

Sodium restriction and insulin resistance: A review of 23 clinical trials

Microsoft Sam starts his car

Exercises in benchmarking and evals, part 7

Small and mid-sized businesses are managing Android devices without Google

KDE daemon – the annoying restart is needed to complete update

Shown HN: Mathend – Microsoft Word but less annoying

Microsoft unveils AI security tools it says outperform competing platforms

Final hurrah? Glasgow's cut-price Commonwealth Games fight for survival

Cracking the code: can AI help us decipher ancient languages?

Open Source Must Be Fun (Or It Will Die)

Evals before prompts: building an LLM OCR for KYC

Facebook now wants a selfie video of your face, too

Three certificates, one domain, three lost launch days

AI 'tokenmaxxing' fades as workplaces look to cut tech spending

A Proposal for a Universal Moral Core

"Cards as Weapons" by Ricky Jay (1977)

Solving Math and Physics Problems You Don't Know How to Solve

Show HN: AI Usage – Native macOS Menu Bar for Claude Code and Codex Limits

News outlet killed story on plagiarism after Cambridge prof hired law firm

Show HN: A Back End You Can Call Directly from React – No API Required

YC Startup School 2026

Compass: Fast, local-first knowledge graph for understanding codebases

Ask HN: How to rewrite `Claude.md` and install the skill for Opus5 and Fable5