Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

nine_k•9mo 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•9mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•8mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•9mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•9mo 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•9mo 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•9mo 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•9mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

The DBLP computer science bibliography needs financial support

Edward Tryon

'The robot never gets tired': Hyundai explains its Boston Dynamics Atlas robot

Inworld TTS-1.5: Upgrading the #1 Ranked TTS Model

Clawdbot Showed Me What the Future of Personal AI Assistants Looks Like

Share your memories and explore the world together

Professor Built a Chatbot to Conduct Oral Exams for His Class

Show HN: AI architectures tested against their own structural limits

A new graph viewer for Ghidra

How the Lawyers Killed Practical Adult Education

Informationism and the Fluid Self: Consciousness, Identity, Reality

Peugeot's "Hypersquare" Steering Wheel Prioritizes Novelty over UX

Europe wants to end its dangerous reliance on US internet technology

Looking for engineers who want to prototype patented new-tech no-fuel engines

Wake: Terminal History for Claude Code

Direct-to-Cell Satellite Internet

How One Steam Developer Made a Million Dollars Selling a Remote Access Trojan

400M-pixel superconducting delay-line camera with 30-ps readout circuit

149M Logins and Passwords in Cleartext Discovered

Elon Musk at Davos 2026: why technology could shape a more 'abundant future'

Show HN: Unicode Explorer – Explore, Search, and Export Unicode Characters

Ask HN: Why can't I apply custom fonts to HN?

Frequently Ignored Feedback

Google shutting down Gmailify after nearly 10 years

Components I created – for database users

Nurses in New York City Say They Deserve $200k a Year. Here's Why.

Amazon braces for another major round of layoffs, 14,000 jobs at risk

Half-Life 2 RTX on Vega 8 APU from 2019 [video]

Gold tops $4,900/oz; silver and platinum extend record‑setting rally

Surge Protectors: Marketing vs. Reality