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?

Amtrak Bicycle Access

Tell HN: Wife used Chat GPT to set up her new biz domain, email, and website

Wargamer's shed named UK Shed of the Year 2026

Neats and Scruffies

The auto industry is building for a past that's never coming back

Show HN: Aidress – open-source discovery and trust registry for agents

How to secure Manticore Search with built-in authentication and authorization

How to export Claude chats to Markdown [video]

America's Bet on AI – The winner takes it all. What if we lose?

Mysterious elephant deaths in Kenya raise questions around pesticides

Rands Management Glossary

OcuClaw: One Human, a Fleet of Agents

America's obsession with whey protein has a delicious consequence: More cheese

Disney Data Dump: What's the Best Day of the Week to Visit the Magic Kingdom?

David Ellison: Here's Why You Can Trust Me with the News

New museum find shows nature can't stop inventing seahorses

The Investing Heavyweights That Backed Situational Awareness Before It Blew Up

Google AI Studio exposed. Drive Trash is fake

Dark Mode for Pinterest – Themes and Night Mode

OpenAI's Unreleased Model Astra Solves Ten Major Open Mathematics Problems

Cyberpunk on 1GB of VRAM [video]

Roby Yonge

Hackerne.ws Cert Needs Updating

Ukrainian and Iran War Coalescence Discussion

Designing a Query System

In-Terminal Jupyter Notebook for Agentic Data Science

Cookies leaked to the wrong host: a URL parsing differential in tough-cookie

Survey Statistics: structured MRP to smooth survey weights

Economy in an automated post-scarcity society

Lunch With Freeman Dyson, in 196,883 Dimensions