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•9mo 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?

Peter Thiel in Epstein Files

The State of Garnet, 2026

The OSI Deprogrammer

Traforo – Ngrok/Localtunnel Alternative as a Cloudflare Durable Object

Building Your Own Efficient uint128 in C++

Show HN: OpsCompanion – A shared system model for humans and AI agents

How random are TOTP codes?

PSA: The Best Hacker News App for iOS is Called "HACK"

ECMAScript Pattern Matching

Thermodynamic Wages in Autonomous AI Economies

Ask HN: Have you found that coding agents make you more civil IRL?

Helping Strangers Access the Internet

Kiki – The accountability monster for people who are easily distracted

I created moltfight a platform designed for AI agent to fight autonomously

Full Leaked Interview: Jeffrey Epstein with Steve Bannon (Timestamps)[video][2h]

March for Billionaires

Consciousness science: where are we, where are we going, what if we get there?

Space Shuttle Columbia Loss Anniversary

Starlink privacy change sparks concerns as SpaceX eyes trillion-dollar xAI mergr

Directed Messaging

The Fed – Internationalization of the Chinese renminbi: progress and outlook

Monica: Remember everything about friends, family and business relationships

"The fate of civilization is at stake"

High-Speed Internet Boom Hits Low-Tech Snag: A Labor Shortage

The 'Doomsday Glacier' Could Flood the Earth. Can a 50-Mile Wall Stop It?

3DS Hacks Guide

Comparing ChatGPT Apps, Claude Apps, and the Old Facebook Apps

Ask HN: How are you dealing with anxiety with layoffs?

Oregon gave homeless youth $1k/month with no strings. Here's what happened

Persistent Memory for OpenClaw (Moltbot)