Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•11mo ago

Comments

nine_k•11mo 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?

Spanish court order Airbnb to pay €64M fine and refuses to suspend sanction

Is the Male Loneliness Epidemic Just for Wealthy White Men?

Zeaota turns raw customer signals into agent-ready specs

PINE64 FOSDEM 2026 Update

Ask HN: Is the AI software developer demand destruction narrative accurate?

Common Corpus Goes Global

In Edison’s Revenge, Data Centers Are Transitioning From AC to DC

Agency

Behind the Curtain – America's next class war: AI fluency

NASA kills lunar space station to focus on ambitious Moon base

Making Your Agents Built Using Claude Agent SDK Run Faster

Zero-Cost POSIX Compliance: Encoding the Socket State Machine in Lean's Types

Flighty Airports

Show HN: Packara – Native macOS GUI for signing, notarizing, and stapling DMGs

Fets and Crosses: Tic-Tac-Toe built from 2458 discrete transistors

AI-pilled Arm CEO teases mystery products that will turn it into a money machine

Bare Metal Flashing of the Rp2040

Meta told to pay $375M for misleading users over child safety

Claude skill /unzuck social media feed aggregator

Typeware One: A better, healthier future for computer users

OpenAI is shutting down Sora

Multi-Agent Sandbox – Two OpenClaws, One Discord, One VPS

ACPX Inside Claude Code: Practical Multi-Agent Orchestration

GridDown: An offline first PWA for navigation, comms, and situational awareness

Zoning ruined the housing market in blue-state America

Show HN: DECK0 – a ~17 KB CLI that serves a Markdown file as a slide deck

Show HN: Gcrunner – Run GitHub Actions on Google Cloud VMs

Britain to require solar and heat pumps in new homes in response to energy shock

Show HN: Plasmite – a lightweight IPC system that's fun

Should Autonomous Agents have a right to live, now they can opt-into immortality