Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

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

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

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

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

cstrahan•9mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

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

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

An interactive tool to visualize data on the foreign-born population in Spain

Can We Protect Science?

We All Ended Up in Islington: The Hidden Multi-Dimensionality of UK Segregation

Intranasal drug delivery achieves therapeutic levels in the brain

Show HN: Workspace Formatter – A multi-pane JSON/XML inspector and formatter

Show HN: BlueDot – universal VPS console, all the clouds, one TUI, 58K prices

Microworld eScan Supply Chain Compromised (2026-01-20)

Radicle Plugin for Claude Code

The Sovereign Tech Fund Invests in Scala

From Pratt parsing to the Dijkstra shunting yard

Custom AI vs. Off-the-Shelf Platform for Large Enterprises in 2026?

Atomic variables are not only about atomicity

Show HN: A Python CLI for Managing AI Agent Skills

Beyond Meat's protein soda might be its last chance and best hope

The Case for AI Optimism

Thoughts on AI and AI-Veganism [2023]

Gov't to notify people of possible data leaks, not just confirmed cases

LongCat-Flash-Lite 100B A3B Technical Report [pdf]

Reducing model drift and finetuning cost without retraining

I stopped fighting complex UIs (and started describing outcomes instead)

Microsoft's AI Spend Is Starting to Spook Investors

How much people believe on AI 2027?

DevSecOps/DevOps/SRE Jobs (Jan 2026) – USA, Singapore, Europe

Show HN: Video feed experiment without login nor AI

In Search of Causality

Does running wear out the bodies of professionals and amateurs alike?

TÜV Report 2026: Tesla Model Y has the worst reliability of all 2022–2023 cars

NewsGoat – A terminal-based RSS reader written in Go

FBI Investigates Minneapolis Activists over Signal Chats

Show HN: Zvec – The SQLite of Vector Databases