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?

AI and the Human Voice

Edalex Celebrates Double Recognition at 2026 EdTech Cool Tool Awards

Codex overtakes Claude Code to become #1 AI coding tool (April 2026)

I wrote a WebAssembly plugin system for my Wayland compositor

0x021 – Durable Workflows

Ask HN: Deterministic codebase maps vs. LLM inferred knowledge graphs?

Ask HN: Why don't frontier AI model providers continuously improve their models?

The brazen rightwing plan to conquer American schools

Show HN: Ptoe.org

Giving LLMs a Formal Reasoning Engine for Code Analysis

ServerCrate – Zero-knowledge Restic backup hosting, from $15/mo

New PC Gaming Handheld Canceled Due to Soaring Storage Prices

Trump administration orders dismantling of the U.S. Forest Service

Show HN: A simple no bloat character checker

Bevy game development tutorials and in-depth resources

Newly created Polymarket accounts win big on well-timed Iran ceasefire bets

Japan lessens privacy laws to become "The easiest county to develop AI in"

You Can Just Print an Air Purifier

Show HN: BakaBags, a tsundere AI that roasts yours Solana wallets

Layoff Thinking

Interview: EmDash, a CMS built on Astro with sandboxed plugins

Show HN: LadderRank: Rank anything with ELO ratings

Stanley Jordan's Two-Handed Technique [video]

Account Verification for Windows Hardware Program Begins October 16, 2025

Ask HN: Advice for college grads starting careers in the AI era?

Little Snitch for Linux – Because Nothing Else Came Close

Store Your Taxes in Git

Claude Glass (Or Black Mirror)

Building a JavaScript runtime in one month

LittleSnitch for Linux