Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

I made a tool to teach you how to sketch portraits

The [UK] Green Party is STILL bad at being green

OpenAI deprecation notice: upcoming model shutdowns in 2026

The Ultimate Personal AI Supercomputer – Nvidia DGX Station

Release PiClaw v1.8.5 – Colossus: The Forbin Project

Designing Data-intensive Applications with Martin Kleppmann (2026) [video]

The Markdown Link no. 24

PHP will get an AOT compiler from the Swoole team in 2027

Show HN: We made 3M jobs searchable on a globe to visualize labor markets

MacPulse – macOS System Monitor and Performance Logging

Show HN: Protovoters -- Free, accessible voter files for democracy

Le Glaude Code – A CLI that responds to Git command with quotes from a Fr movie

Show HN: Desktop OSD that reads Claude Code's rate limit headers

A robot is beating human pros at table tennis

Anthropic is A/B testing removing Claude Code from Pro plans

TalentRecruit

Corral: Measuring how LLM-based AI scientists reason, not just what they produce

FreeBSD Status Report First Quarter 2026

Texas launches $750M plant, targets growing New World screwworm threat

Ask HN: Is the ongoing AI research driving LLM models to be better?

The Prevention of Literature (George Orwell, 1946)

Microsoft issues emergency update for macOS and Linux ASP.NET threat

I blind A/B tested 40 Claude prompt codes, only 7 shift reasoning

Stop Hardcoding Your Timeouts

Retractions of scientific papers by Nobel Prize Winners

Notes on writing a voxel game in Dyalog APL

Signaling Is the Intelligence

The Log Is the Database

Ask HN: Linguistics/Computing Overview for the Layperson

Production MCP Patterns, Part 2: The Agent Stack Grew Up