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?

Wilmund

Back to School with High-Speed Attack Drones

A Stark Warning from a Former AI Doomer

When Corn Flakes Were Part of an Anti-Masturbation Crusade

Slipstream – explore F1 results and compare lap times

California Did Little to Punish a Raw Milk Farm After Two Girls Got Sick

Secret of Orange Cats Revealed After 60-Year Search

We're All Working for AI Now

Podcast to Yoto Playlist Sync

Agisoon.lol: Predictions of the Singularity

Show HN: Listener – 100% on-device meeting notes for Mac ($5 once, no cloud)

IDC: Smartphone Shipments Set for Record 16.7% Drop in 2026

Testing database interactions in Golang

Ratcn – customizable Ratatui components you can try over SSH

Show HN: Teasr – Turn your product URL into a launch video

IDC: PC Sales Nosedived 20.1 Percent in Q3

Doory open source canva alternative

High console prices push PlayStation and Xbox sales to new lows

Sexually transmitted diarrhea: The infection that's becoming more drug resistant

Arrival Mind (children's book about AI risk – narrated)

How much privacy should you expect at church?

Show HN: I built a macOS screensaver that reacts to AI coding agents

Alien Crash Site

Dbt enables data analysts and engineers to transform their data

Show HN: Try Free Long-Term Memory for AI 50M-Token Window

Duplicity and Photo and Video Manager

One of 20M Videos

Show HN: Throw Alice and Bob into Sagittarius A*

We spent $1200 on a booth at HITEX 2026. Here's what we got

Borel jet extensions via higher categories and homotopy type theory