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?

Kairos: The ancient Greek art of knowing when to act

Waymo recalls 3,800 robotaxis after they drive into flood waters

Building a UMatrix Replacement

Ghost of long-extinct ancestor lives on in people today

Build a Full-Featured Text Editor from Scratch (Rust)

Apple Sold Out of Mac Minis and Mac Studios

Git Is Not Fine

What Is Code?

Bidirectional typechecking that does not stop

Why Gemma-4 26B MoE works in HuggingFace but breaks in prod inference engines

Ask HN: Can I take Meta to court for banning business Insta or FB account?

Linus Torvalds declares AI-fueled code surges as the new normal

Goodgallery: WebGL sprite engine that can load 100k thumbnails in 1 second

OpenAI's KOSA Endorsement Is Regulatory Capture with a Smiley Face

Elephants Still Don't Play Chess

EY retracts study after researchers discover AI hallucinations

Anatomy of a WooCommerce Skimmer: A Technical Deep-Dive

Magnus the wandering walrus swaps Scotland for Norway

Long Live Qt for HarmonyOS

Trending on Amazon: Cancer books by synthetic authors

U.S. DOJ demands Apple and Google unmask over 100k users of car-tinkering app

Rich Guy Quote Journalism

Ask HN: Has Google Deprecated Inurl:?

From PDFs to AI-ready structured data: a deep dive (2024)

Subumbra – Attempting to keep API keys safe – Alpha Release

Feedr v0.8.0 – a TUI RSS reader, now read the full article from your terminal

Greg Brockman Officially Takes Control of OpenAI's Products in Latest Shakeup

Show HN: Check for CVE-2026-31431 (copy.fail) without overwriting su

Show HN: Burn, baby, burn (those tokens)

Vanguard succeeded because it is owned by customers