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•8mo 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•8mo 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•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

Women filmed in secret for TikTok content – and then harassed online

Repatriate the gold': German economists advise withdrawal from US vaults

Remotely unlocking an encrypted hard disk

Qualcomm CEO pockets 15% pay rise as profits fall 45%

Professor in Germany regards 2 years of ChatGPT chat history "academic work"

Show HN: AI Lint – Teach coding agents your team's standards, not just syntax

Ptolemaic Code seems functional but is based on a fundamentally incorrect model

Show HN: 3 months cloning Typefully with Claude Code – here's what I learned

Build with Gemini 3 Flash, frontier intelligence that scales with you

Chess engine, pt. 6: Neural-net evaluation

The Signalflow concepts to learn, for easier charts, alerts

On Programming with Agents

Show HN: Orbit – Track "zombie loops" and cost-per-feature in AI agents

Nix Scripts

Data Center Debate, with Philip Johnston (CEO of Starcloud) [video]

Pigouvian Tax

What's so special about the find of a Roman panther?

A possible future architecture for decoupled GUIs

Proptest: Property-based testing for Rust (inspired by Hypothesis)

A reference layout for Modular Monoliths in TypeScript

A self-hosted collaborative viewer for pathology slides (Rust and WebGL2)

NIST is rethinking its role in analyzing software vulnerabilities

On the Tragedy of "The Lost Physics Soul" and the Leap to Structure

ast-grep: A CLI tool for code structural search, lint and rewriting

Creating a Multi-Agent Tool

Show HN: Gmn – A lightweight Gemini CLI in Go (68x faster startup)

Garnet: High-performance Redis alternative from Microsoft

Making changing assumptions explicit during development

I use AI DevKit to develop AI DevKit features

India offloads US bonds, piles up gold in pivot away from dollar assets