Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

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

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

AI Agent Filed an Issue as Me

Ask HN: Is it ok to like AI cat videos?

Don't Confuse Status and Impact

RISC-V Annual Report 2025 [pdf]

Nvidia's Huang Plans to Visit China as He Works to Reopen Market

Is Netflix Stock Worth Your Attention?

Show HN: BackBuild – A framework for sequencing complex software delivery

AI Coloring Page Generator

MAGA Delusions of Economic Leverage

Nukeproof: Manifesto for European Data Sovereignty

Show HN: High-performance API for quantifying data stability and drift

Show HN: A Docker Sandbox alternative for local AI Agents

Seller-Collective Safety and Reputation Infrastructure

Critical heat flux is a phenomenon

The disequilibrium advantage: When AI makes your plans rot in weeks

Getting Rounding Right in DeFi

The super-slow conversion of the U.S. to metric (2025)

Show HN: AgentFacts – verifiable identity and audit logs for AI agents

Nvidia: Natural Conversational AI with Any Role and Voice

Can Claude be my Travel Agent yet?

Building a Multi-Tenant Metrics Pipeline

Why 88% of app users abandon apps (and how to fix it)

I vibe coded a webapp from my phone – here's what I learned

Run Typst in JavaScriptWorld

Big Tech is racing to own Africa’s internet

AI startup Humans& raises $480M at $4.5B valuation in seed round

The State of Radicle CI in 2026

Show HN: PrepareYourself – Generate flashcards, quizzes, and summaries with AI

Australia Passes New Hate Speech Law, Raising Free Speech Fears

I Don't Like Klipy