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?

Show HN: OdinForge – Breach simulation that chains vulns into attack paths

We built our startup infra on FreeBSD in 2026

pg_ash: Active Session History for PostgreSQL wait event sampling

How persistent is the inference cost burden?

Windows 99

Study: Respiration patterns during sleep crucial to memory consolidation

Ten Candles

AI Story Generator with Pictures

Pentagon might ask contractors to certify they don't use Anthropic's Claude

RageDetector – detects aggressive typing and forces me to calm down

Lentando Private Habit Tracker

Why Europe doesn't have a Tesla

SnkvDB – Single-header ACID KV store using SQLite's B-Tree engine

Software Engineering in 2026

Ask HN: Is the definition of AI that it can fool people?

Choose Your Fictions Well (2010)

Tell HN: Google Allegedly Sent NSFW "Grok" Notification to People

If AI Agents Do the Work, Who Pays for the Seat?

Agent Skills Hub – Security first directory for AI agent skills and MCP

Show HN: TerminalRant – Mastodon for developers who live in the terminal

Show HN: QuickStaging – AI virtual staging tool built by a 19yo student

From Claude Code to Figma

Wi-Fi 7's Best Feature Doesn't Work (Yet) [video]

Show HN: StatusPing – Uptime monitoring for $9/mo

Pidgin Plugins

How the Olympics Are Mixed Live 4k Miles Away [video]

Meshcore IRC Bridge

Copper-rs the deterministic OS for robotics gets full observability

Show HN: Verified 16.7M Mac chip architecture on $60 Android phone

Multi-Language MCP Server Performance Benchmark