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?

The Infinite Policeman – Preliminary Movement

Playing with Jupyter style playbooks that work with Claude Code

Building a Micro-Drilling Machine [video]

Better CSS fluid sizing with round()

Void Room – an offline writing app that does nothing on purpose

Your Evals Will Break and You Won't See It Coming

DeerFlow 2.0 – Deep Exploration and Efficient Research Flow

More than 100 UK datacentres plan to burn gas to generate electricity

SFC vs. Vizio Ruling on General Public License Compliance

Animated 3D map of Chongqing metro [video]

2ality Blog: Temporarily Offline because of AI

Old Kindle e-readers will stop working on May 20th

Ask HN: Which AI harness comes close to Claude Code?

Code Orange: Fail Small is complete. The result is a stronger Cloudflare network

`Never-ending' AI slop strains corporate hacking reward schemes

Spring Physics in my Word Game? A technical deep dive into SvelteJS animations

Ask HN: Favorite In-Depth Deep Dives

Defence Tech Jobs for the week of 2026-05-18

Hacking a weird TV censoring device [video]

AI Eats the World (2026)

RAG vs. Fine-Tuning – The Question Every AI Builder Gets Wrong

Wayland Compositor in Minecraft [video]

Stanford AA228V: Validation of Safety Critical Systems (2025)

Donald E. Knuth: The letter S [pdf]

TestTest

Lost at sea: the man who vanished for 14 months (2015)

Pope creates AI study group as Vatican prepares release of first encyclical

SPF Softfail vs. Hardfail: A Data-Backed Decision Guide

LLM Tracing with MLflow AI Gateway

Letters from a Stoic by Seneca