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?

Would HN Accept PRs?

Recovoly – Built for Better Document Recovery

240M-Year-old giant "sand creeper" found hidden in retaining wall

Pomodoro CLI

Know Your .agent?

OpenClaw Had a Rough Week

The AI operator: Biggest role in Silicon Valley

Map projections: a practical guide to common mistakes and how to fix them

Facebook Buying Instagram For $1B.(2012)

Car Dealerships Scam America [video]

How I caught an illegal Russian spy [video]

Why should a Trace-ID be 128 bits? (A Surprisingly Long Answer)

FairwayMapper – Introducing Golfers to Mapping

Banking Malware hiding inside a flashlight app? (BeatBanker / BTMOB)

Garmin releases new luxury home audio system globally

The Kurzweil Library

A bidirectional typechecking puzzle in the Grace programming language

Code never mattered in the first place

The Place of Houses: Questionnaire [pdf]

How to improve code quality of Claude Code and codex (on 2026-05)

It is distressing that AI does not know the seven cardinal virtues

You made me rich, thank you

Donlyn Lyndon, Last Surviving Creator of the Sea Ranch, Dies at 90

NHS England withdraws public software over AI hacking fears

Show HN: Yumi – Your workspace for AI chat, notes, and research

Fedora is now the default Linux recommendation, and Ubuntu did this to itself

The Deletion Test – The Phoenix Architecture

The 80% Problem in Agentic Coding

How the Lobsters front page works – nilenso blog

The Boring Internet