Packed Data Support in Haskell

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

77•matt_d•1y ago

Comments

nine_k•1y 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•1y ago

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

Zolomon•1y ago

They mention this in the article.

spockz•1y ago

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

cstrahan•1y ago

No, one example of why being variable sized integers.

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

carterschonwald•1y ago

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

tlb•1y 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•1y 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•1y 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•1y ago

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

lordleft•1y ago

This was very well written. Excellent article!

NetOpWibby•1y ago

Is this like MessagePack for Haskell?

Discover What Your Potential Users Are Talking About

MCP vs. Bash

Why We Stopped Making Einsteins

WestJet labour dispute is a proxy battle between Carney and unions

Show HN: Changed how I use agent harnesses

Show HN: Curved Crease Folding

Branchless Rust: Making a Filter 4x Faster by Removing an If

Conflict-Freedom as a Progress Condition

The World Crossed a Major Solar Milestone [3TW]

Linux page-cache corruption via TC pedit: a new Dirty-class variant

Don't be a meat proxy

R-457 – a 27M-parameter reasoning model running offline across two ESP32-S3

Linux 7.2-rc6: The biggest rc6 in years

Britain's Hikikomori

Situational Awareness and the Impending Stock Market Volatility

How AI Is Reshaping Human Reasoning and the Rise of Cognitive Surrender

A Wild Netflix Lawsuit Shows Why Drugs and Alcohol Don't Mix with Work

Lists for Devs Who Just Shipped and Now Need Users

How fast is C++26's std:hive?

Foldables are sort of boring now – and that's great news for Apple

Show HN: Chinese are offering Claude/Codex offers 90% off

More German than many Germans

Japanese Matcha Price Tracker 2026: Live Auction and Wholesale Data

Company Offering Printed Books to Train AI Stops After 404 Media Coverage

Show HN: MPEdb a drop in replacement for SQLite3 with concurrency support

The Math Superstar Who's Terrified of AI–and Just Took a Job at OpenAI

Alternative Versioning

Show HN: NoCrap – Gamifying porn addiction recovery

Compile Zod schemas into zero-overhead validation functions at build time

Five Takeaways from the Times Investigation into Larry Ellison's A.I. Gamble