Packed Data Support in Haskell

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

77•matt_d•10mo ago

Comments

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

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

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

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

cstrahan•10mo ago

No, one example of why being variable sized integers.

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

carterschonwald•10mo ago

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

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

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

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Every agent framework has the same bug – prompt decay. Here's a fix

Turn pull requests into guided walkthroughs

Ferguson's Law: Debt Service, Military Spending, & Fiscal Limits of Power (2025)

Hubble spotted a 'dark galaxy' that's at least 99.9% dark matter

Why Mars Astronauts Need More Than Just Space Greenhouses

Show HN: HushWork – A focus environment with ambient sounds and timer in one tab

Clonezilla Live (3.3.1-35)

Mazda Onboard Carbon Capture

Why NVLink Is Nvidia's Secret Sauce Driving a 10x Performance Boost in MoEs

Pilot Human Factors Visualization

Show HN: PyMOL-RS – Rust reimplementation of PyMOL with modern rendering

A random color on every reload

Show HN: I built an AI that turns emailed PDFs into ledger entries in 60s

Why etcd breaks at scale in Kubernetes

Rejecting Reality in the Age of AI

Local-first desktop utility to migrate chats from ChatGPT to Gemini

Show HN: Autobs – Translate "fix: null ptr" into "Enhanced platform stability"

Rerun 0.30: Plot Any Scalar and Custom GPU Visualizers

Bun v1.3.10

Cheaper and greener way to make high-quality graphene from waste peanut shells

The Bet on Juniors Just Got Better

Show HN: Neo – Turn any web app into an API by capturing browser traffic

Show HN: Grubl – AI and structured recipe generation

Show HN: Better Hub – A better GitHub experience

Norwegian state newspaper investigate AI psychosis

Little about software engineering has changed over past last three months

Axelera: Cutting-edge hardware and software platform for accelerating inference

WTF Happened in 2025?

OpenClaw broadcasts its screen while I'm at the gym [video]

Asura: Looped Language Models done better