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: Defcon like browser game with slower pace and growth

What Reel You Will Get Next

Award-Winning AI Literature

AI and the Enclosure of the Scientific Commons

Utah Woman Speaks Out After Cop Body Slammed Her at Data Center Protest

Pearl Sandbox

Let's Fly

Show HN: Buildnotes – Turn pull requests in "how it's made" posts

Vulnerability Discovery and Exploitation Trends in the AI Era

Why governments pulled websites offline over the decades-old PHP language

Retired decorator's Pokémon cards sell for £1.5M

Elon Musk invests about $1B in Skydance

Delivery robots have moved to the street

Hornet: Building Durable Workflows for Local LLMs

It's Time to Take Starlink Away from Elon Musk

Making Startups Powerful

Trump Called Musk and Asked Him to Lift Ukraine Starlink Restrictions

Toronto Crime Stoppers pauses program after investigation of data leak

The Surprising History of Copyright and the Promise of a Post-Copyright World

Arc Browser is shutting down

Senior roles were 71% of net US software postings growth, May 2025 to May 2026

Show HN: Decido – an open decision model that runs CPU-only on a laptop

ClaudeTTY: An Undying Replacement for Cmux

US to fund fusion venture Helion backed by investors with ties to Trump

I run Filozy: 39 free PDF tools that run in the browser, nothing is uploaded

The years Americans outlive driving

Tell HN: Claude resets expire at an arbitrary time during deadline day

Security Sweet: Get your AI agents on a leash for security patch

Iceye and Nokia partner with Ukraine to develop satcom capability

Meta and chip stocks decline as AI trade comes under pressure