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?

Nasal Demons

Foreign National Gets 20 Yrs for Trafficing Nuclear, Narcotics, and Firearms

Show HN: Moji – A read-it-later app with self-organizing smart collections

The free-energy principle: a unified brain theory?

Data Center Signal

Show HN: MHA OC Maker – Create My Hero Academia Original Characters with AI

Can A.I. Be Pro-Worker?

Uni-1, Luma's first unified understanding and generation model

AI benchmarks: What Jellyfish learned from analyzing 20M PRs [video]

Ends and means; an inquiry into the nature of ideals (1969)

Show HN: I made a design portfolio reviewer

Parsync, a tool for parallel SSH transfers – 7x faster than rsync

Show HN: Rent Your Idle OpenClaw Browser to AI Agents

The largest emergency stockpile of crude oil is quickly falling apart

Show HN: A tool to make your text look fancy anywhere with Unicode

Statistical Uncertainties in the Non-Gravitational Acceleration of 3I/Atlas

Codex Fast Mode – Increase GPT-5.4 Speed by 50% at 2x the cost

Show HN: Settle It – turn "Pizza or Thai?" into a shareable poll

Anthropic: Labor market impacts of AI – A new measure and early evidence [pdf]

Trump Bought Netflix Debt Amid Paramount's Fight for Warner Bros

Windows key seller sentenced to 22 months in prison

OpenWrt 25.12.0 – Stable Release

How to Install and Start Using LineageOS on Your Phone

Lise Meitner's Nuclear Vision

Where things stand with the Department of War

Third Kairos (Space One) launch fails

The FCC Wants Your Next Customer Service Agent to Be in the U.S.

Show HN: Multicorn Shield – Open-source permissions and approvals for AI agents

Vet

Self-Learning Customer Engagement