Packed Data Support in Haskell

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

77•matt_d•12mo ago

Comments

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

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

Zolomon•12mo ago

They mention this in the article.

spockz•12mo ago

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

cstrahan•12mo ago

No, one example of why being variable sized integers.

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

carterschonwald•12mo ago

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

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

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

lordleft•12mo ago

This was very well written. Excellent article!

NetOpWibby•12mo ago

Is this like MessagePack for Haskell?

Tell HN: Claude Code is unable to respond to this request

What Is Dyslexia?

Dyslexic thinking made me the scientist I am today. If we could harness its

Show HN: Text Trace – Keynote-style SVG text trace animations for the web

List of personal sites that host Wander Console, a tool to explore the small web

Startups only remember backups after the crash

GPT Image Generation Models Prompting Guide

Anthropic created a test marketplace for agent-on-agent commerce

Musk Touts Universal Income as Remedy to AI-Driven Unemployment

Pratt parsing is a black box

A high-performance 2D graphics painter that use SDL3 GPU API

Query neural network weights like a graph database

Network File Systems on Macs

Ask HN: How I find a job where what is needed is solid code, not firefighting?

London Reverse Marathon FAQ

Stealth browser survey, April 2026

Show HN: Are AI competitor newsletters useful?

Deep Moats and Platform Shifts in Computing

GitHub unwanted UX change: issue links now open in a popup

HVD Bodedo

The cause of heart disease is inflammation

Show HN: A minimal context engine with streaming API

Claude Opus 4.6 vs. Opus 4.7 Effort Levels and Prompt Steering Benchmarks

Claude Platform on AWS

The Physics Slop That YouTube Wants Tibees to Make

Ask HN: What percent of your YouTube consumption is listening only?

Anthropic's Argument for Mythos SWE-bench improvement contains a fatal error

Ask HN: Where are all the consumer ChatGPT apps?

Show HN: A Calendar for Songs

Micron pushes US Congress to crack down on chip tool sales to Chinese rivals