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?

Tabularis: A lightweight, cross-platform database client. Hackable with pkugins

Flowyble Studio – Run Claude, Copilot and Codex Side-by-Side

The Munro Lecture with Adam Tooze – April 8 2026 [video]

Energy-Based Models Is All You Need

The Infinity Man: Demis Hassabis, Colleagues and Rivals

Mark's Magic Multiply

Give Your Agent a Canvas, Not Just a Chatbox

The Great GPU Shortage: H100 Rental Prices Up 40%

Due Diligence Framework Before Your Business Commits to Open Source

Show HN: I missed my terminal so I rebuilt email

AIYO Wisper – Local voice-to-text for macOS (WhisperKit, open source)

What We Learned Building a Rust Runtime for TypeScript

Rust terminal projects in 3 years

How AI Is Reimagining the Game of Golf–For Both Players and Courses

The tragedy of leisure

State of Utopia passes its first law

EU fingerprint and photo travel rules come into force

Umeshism

Artemis II is competency porn

Why you need to replace your native macOS screenshot app?

Automated Browser Testing with MCP

Kaze Emanuar: Illegal 3D Rendering Techniques (N64) [video]

Picasso's Guernica (Gigapixel)

Show HN: LSM Trees: MemTable, Compaction, and the Amplification Triangle [video]

France's government is ditching Windows for Linux, says US tech a strategic risk

Reverse Engineering File Format Steganography Chain of the TeamPCP Attack

GazeFollow from Scratch

Incremental Compilation with LLVM

I built a skill manager for AI agents. The agents install the skills themselves

I built a programming language in 6 days without writing a single line of code