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?

Show HN: A Libc-free HTTP server compiled to native x86-64 with FreedomLang

Repeated Azure VM deployments split into operational lineages

Cpp2Rust: Translates C++ to safe Rust automatically

Request for Senior Developer and Senior Cybersecurity

Show HN: NoMac – let your AI agent ship iOS apps without a Mac

Kids run experiment to make $1M

A new kind of robot swims the seas and soars the skies

Garnix Is Joining Shopify

The Politics of Shrimp

Turbopuffer vs. Manticore Search on a couple of cheap VPS

Data Colada [136] Metadata Falsificada: The Cover-Up File in Gino vs. Harvard

How to Build a Coding Agent

Show HN: Offline Substack Reader

Compilers and AI 'Cyber' Defense

Scan Scam: Criminals Redirect China's Public QR Codes to Porn

The fix for my AI agent wasn't making it smarteR

Terrorist Groups Are Using A.I. To Gain an Edge in Battle

Show HN: Living Neural Network on the Webpage

IPv4 and IPv6 Subnet Calculator

Why Write Code in 2026

Database Consistency Models

Commit Messages

Meta AI image detector fails to identify some of its own cropped AI images

Show HN: Journal, Yours to Keep

German lawmakers pass cost-saving bill that drugmakers say will drive them out

USDA lowers beef export sales by 90% amid growing doubts over data

Generalizing LLMs to PLTs: Probabilistic Language Tries

We May Owe Our Intelligence to Our Unique Neurons

Steam sales reportedly topped $11B during H1 2026 due to shifting trends

Hands-On with the AMD Ryzen AI Halo