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?

Have we tried asking women about the 'birth rate crisis' yet? – Glamour UK

Extracting Gold from Antigravity's Brain

Frontier-CS 1.0 Release

Show HN: Run QuantLib pricing in parallel via gRPC and FlatBuffers

How I've run major projects (2025)

Show HN: I Made Claude Code for Calories Tracking

Ask HN: "Marking" Paywalled Articles Posted on HN

Historical Change in Midlife Development from a Cross-National Perspective

Notepad++ supply chain attack breakdown

Lexicon of Life Regulation

Simulation, Consciousness, Existence (1998)

Walmart hits $1T market cap

International AI Safety Report 2026

Does AI already have human-level intelligence? The evidence is clear

Show HN: Obsidian meets Claude Code. A Markdown graph for agents and context

A Role Model for How to Die

Show HN: Dynamic Markdown Flashcards without database (Obsidian)

Scurl: Agent First Curl Wrapper with Markdown Extraction and Secret Blocking

French headquarters of Elon Musk's X raided by Paris cybercrime unit

Democrats unveil WA income tax on people earning over $1M

A CFO explains the history of EBITDA [video]

Evaluating Multilingual, Context-Aware Guardrails

Ask HN: How do you detect silent data loss in user-facing systems?

Ask HN: Cheap laptop for Linux without GUI (for writing)

Solving the AI Agent Dilemma: "Ask" Redefines Agent Skills Distribution

Hostile (Corporate) Architecture

uops-again.info: corner-case behaviours of port assignment on Intel processors

In Depth – Memory Governance: The Achilles' Heel of Enterprise AI

The Death of Code and the Rise of Data: The Software Economics Revolution in AI

Electronicos Fantasticos