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?

Digital Tools for Conviviality

Fast food isn't only culprit in expanding waistlines – DNA is also to blame

New Intel Linux Driver Workaround Halves Initial Game Load Time for MHW

Illegal Frequencies: How Pirate Radio Gave Voice to the Underground (2025)

Défi à la Cryptanalyse Classique

What Would Marx Say Today?

The Robotics Data Pareto Frontier

Intra: Design notes on an LLM-driven text adventure

Why Are There No Holes Around Trees? [video]

From Breadboard to Perf Board (#1) – Adding a Reset Button, Learning to Solder

Sveltia CMS Saved My Blog

Introducing the Agents tab in your repository

Andrej Karpathy (Inspired) Skills

Dollar falls after Trump comments

CDC vaccination databases have been frozen under RFK Jr

Roo Code 3.44 Release Updates – Worktrees (new) – Parallel tool calls

Six Psychological Flaws That Keep the Gifted from Living Up to Their Gift

EU and Brazil conclude agreements on free and safe data flows

Show HN: A simple, transaction-safe SQL migration tool

Building multi AI awareness in AI group chats

CVE-2026-23993: JWT authentication bypass in HarbourJwt via "unknown alg"

PostgreSQL on Kubernetes vs. VMs: A Technical Decision Guide

Clawdbot Remembers Everything

Ask HN: Block short-form videos on home network?

Windows 11 KB5074109 update nukes Nvidia gaming performance and stability

Gladys West, Unsung Figure in Development of GPS, Dies at 95

TikTok claimed bugs blocked anti-ICE videos, Epstein mentions; experts call BS

Cursed Units 3: The British Empire Strikes Back [video]

Old Insurance Maps – Georeferencing Sanborn Fire Insurance Maps on Modern Maps

Show HN: An interactive jazz study guide