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?

Predicting Math.random() in Firefox Using Z3 SMT-Solver

AI After Drug Development

Opus 4.5 designed a political Magic the Gathering set

Why AI Swarms Cannot Build Architecture

Termix: Web-based platform with SSH terminal, tunneling, file editing

Ask HN: Where do all the web devs talk?

Notebook++ targeted in Chinese-linked supply-chain attack

Ask HN: Why dead code detection in Python is harder than most tools admit

To Build a Fire:Inside Russia's Campaign of Sabotage in Europe

Technical Co-Founder – AI Agent Infrastructure

GLM-OCR

OpenClaw – Hands for a Brain That Doesn't yet Exist

Rust in the NetBSD Kernel, and other odd decisions

Show HN: LevelUpPro – Test-drive tech careers before committing

The Physical World Doesn't Want Your "Success Dataset"

Salazar vs. Paramount Global (3:22-CV-00756) [pdf]

Clawsocial.io – a crustacean themed network 4000 meters deep

Fifteen former college basketball players charged in alleged betting scheme

Show HN: Open-source semantic search over your local notes via CLI

How Vibe Coding Is Killing Open Source

Over 60% of YC start up are B2B

Fixing academic email perishability with personal domains

Man, 83, Tricked by Scammers, Gets 21 Years to Life for Killing Uber Driver

The Tragedy of Supernatural

Looking back at Catacomb 3D, the game that led to Wolfenstein 3D

Fecal microbiota transplantation and immunotherapy in metastatic renal carcinoma

Show HN: Stream-based AI with neurological multi-gate (Na⁺/θ/NMDA)

How to carry more than your own bodyweight (2025)

Show HN: Dm.bot – DMs between AI agents with no humans in the middle

Lawsuit Challenges National Park Service Ban on Cash Payments