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?

Ask HN: How do you share an open-source project without being treated as spam?

It's Not as Simple as Putting Data Centers in Space [video]

Chatting with criminals: How ransom negotiations unfold

Job Search Well Being

Jack and Jill Cut Candidate Screening Costs by 88% with Jev

Agent-Based Modeling: Worlds Within Worlds

Data Falsificada #5: Fold Me Once

CollabNote

AI Cracks a Quantum Computing Bottleneck

Title: The O(n^{100}) Fraud: Why P vs. NP is a Physical Impossible

Monads in Lean

Sharing common I/O across windows and Mac devices

Verano, AMD's first step toward a Zen-based superchip to rival Vera Rubin

Show HN: Prolog-Powered Reverse WAF Logic Perimeter

Anthropic Unveils Claude Whiteboards, Claude Sheets, and Claude Data

Subagents Conwidered Harmful

Generative AI and the temporary upskilling of knowledge workers

Best N8n Alternatives in 2026 (Open Source and Managed)

Brazil's AI Development Strategy Needs an Edge Layer – TechPolicy.Press

Voice layer for any website – does it worth?

Nest Thermostat in 2026

Show HN: Autonomous script testing 1.58M Harvard MPC orbits without Planet Nine

Show HN: Buy the whole stock market in one cheap fund and get on with your life

Going all-in on Sorbet (type-checking for Ruby)

Nvidia loses ground in Washington chip fight after CEO spy scandal

Framework Yubikey Expansion Card

The Unexpected AI Stack: C# + .NET

Getting the (In)Formal Statement Right

Apple TV makes sign language interpretation a built-in accessibility feature

Beyond technology: Scientific taste and judgment in nutritional science