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?

NYC considers increasing minimum wage to $30 by 2030

Show HN: Readhn – AI-Native Hacker News MCP Server (Discover, Trust, Understand)

Curly Prompt – An AI Prompting Language with Local LLM Powered AI Agent

Saudi Arabia declares 2026 as the Year of AI

The Creator of Wordle Tries to Solve the Cryptic Crossword

Microsoft Patch Tuesday, March 2026 Edition

Embrace the Uncertainty

AEO: What happens when AI answers instead of linking (4-part series)

Datafly – data agent that automatically understands any database you connect

Apple's New MacBooks Have a Keyboard Change You Might Have Missed

Show HN: Principled Agentic Software Development

Lynas locks Japanese rare earths deal

Ask HN: Getting Someone at Facebook to Listen

Ohio judge rules that Kalshi is sports betting and must adhere to state law

The Beginning of History

Game Modding with GenAI: A Case Study of Stardew Valley Character Maker

Cybertruck Tried to Drive 'Straight Off an Overpass' Attorney Claims

The History of Stoner.com

Wero announces the launch of its ecommerce solution in

Building Kepler

A 1,300-pound NASA spacecraft to re-enter Earth's atmosphere

At what level of deep context engineering does AI output become human-crafted?

State of AI 2026: The $600B inference subsidy, energy bottlenecks, and labor

Tell HN: Vertical tabs has arrived (behind a flag) in Chrome stable

Ask HN: Is Starlink still being jammed in Iran?

RoqueOS – an OS to control your homelab (now on the Apple App Store)

SSH Is the Agent Internet

Show HN: Mumpix – Local-first AI infrastructure and $1B developer grant

MPs give ministers powers to restrict Internet

Amazon Cognito and FusionAuth Comparison