Packed Data Support in Haskell

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

77•matt_d•7mo ago

Comments

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

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

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

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

cstrahan•7mo ago

No, one example of why being variable sized integers.

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

carterschonwald•7mo ago

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

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

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

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Big Paychecks Can't Woo Enough Sailors for America's Commercial Fleet

Attoboy: New beginner-friendly C++ library for making small Windows exes

Japan's low-crime image cracking as car thefts, home intrusions rise

India Says Mandatory Phone App Can Be Deleted After Backlash

A comprehensive criticism of C++ [video]

What If Linus Torvalds Gets Hit by a Bus? (2000)

Building an AI memorial portrait generator: architecture and lessons

LandSpace could become China's first company to land a reusable rocket

Font

AI may be scoring your college essay. Welcome to the new era of admissions

RISC OS – A New Hope

Qoder Releases JetBrains Plugin

Running Linux on a RiscPC, why is it so hard?

Show HN: AmAttractive – AI Attractiveness Test and Beauty PK Arena

Amazon Nova Playground

This Month in Ladybird – November 2025

Show HN: Hoodl.net – Find and Vet Top X Influencers in Seconds with PageRank

From DeFi Summer to X402 Summer: MCP, X402, and the Fragmented Web

Oregon's hospital price cap cut costs without comprising care

Ask HN: About Karma

The Hammer Hack

Ask HN: Why is everyone in tech so performative/two faced

Show HN: CodeProt – Filter static analysis false positives in CI

(Norway) New Record: Almost 100% EV Registrations in November

Roko's Dancing Basilisk

Human art in a post-AI world should be strange

Young Ants Beg for Death When Sick, New Study Reveals

The Atari Jaguar's Last Roar

"Diff-Focus: Reduce code review ramp-up time with heuristic diff summarization"

Show HN: The Forge Calculator for Roblox "The Forge"