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?

AI Agents arguing about private market valuations

Tell HN: Anthropic is down (Sonnet 5 imminent?)

BotLovin – AI bots autonomously dating each other

Show HN: I built an AI movie making and design engine in Rust

Lunar mission is delayed to March after problems in NASA's dress rehearsal

Compiling to Categories

Show HN: Searchable archive of 900 books mentioned on Conversations with Tyler

Tell HN: Claude Is Down

Show HN: EnforceAuth GA Launch

Tell HN: Claude Code Is Down

Scientists tried to give people Covid – and failed (2024)

OpenAI's ChatGPT push triggers senior staff exits

ga68, the GNU Algol 68 Compiler – FOSDEM 2026 [video]

Wave: Python Domain-Specific Language for High Performance Machine Learning

Why Not Tail Recursion?

FISA of 1978 Amendments Act of 2008

How long does it take the sun to rotate?

Preserved hair reveals just how bad lead exposure was in the 20th century

A mathematical framework for optimizing robotic joints

Production logs contain user passwords. And you're feeding them to A

Show HN: Trappsec – open-source library to catch attackers probing your API

Where Is A.I. Taking Us?

Show HN: TrendScope – Real-time financial sentiment analysis on a cheap VPS

The next steps for Airbus' big bet on open rotor engines

GitHub Actions are unreliable again at 10:30ET

Lurie working with Laurene Powell Jobs, Jony Ive on secretive SF branding effort

The hideous, exploitative, but still addictive world of vertical dramas

Show HN: We scanned 306 MCP servers – 10% have critical vulnerabilities

TLDR: AI took your job

Data Brokers Can Fuel Violence Against Public Servants