Packed Data Support in Haskell

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

77•matt_d•1y ago

Comments

nine_k•1y 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•1y ago

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

Zolomon•1y ago

They mention this in the article.

spockz•1y ago

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

cstrahan•1y ago

No, one example of why being variable sized integers.

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

carterschonwald•1y ago

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

tlb•1y 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•1y 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•1y 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•1y ago

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

lordleft•1y ago

This was very well written. Excellent article!

NetOpWibby•1y ago

Is this like MessagePack for Haskell?

Chrome Extension Job Alerts

The Death of Reading (With James Marriott) [audio]

Graph Technology Roundup – August 2026

Why China Can't Innovate (2014)

An Interview with Rich Jaycobs

The Complete History of the Elves of Middle-Earth [video]

A Key Safety Feature Shipped in the May OpenTofu Release

Show HN: A game about fake news and memes

Rendering pull requests in the GitHub Copilot app

Australia says OpenAI agent hacked into government website

Pentagon Investigating How F-35 Fighter Jet Parts Bound for US Were Diverted

AP: Avoid language that gives [AI] human characteristics

Qubits on NonQuantum HW Tested

Liquid Network Security Incident Assessment

FLAWED's Flaws and What This Means for Industry Research

Geminigravit Core: De la teoría estática

We used an AI agent to fix an open-source bug. Someone asked to ban us

Shadow roots, explained with live examples

Show HN: Does per-step reasoning effort save money in Claude Code?

Show HN: ChaosTree – Cache-Aware Java NavigableMap and NavigableSet Library

Show HN: Posting Puzzle – A Game Made of Post's Correspondence Problem

AI startups with hyper ARR growth – what's happening inside these companies?

Nesbox: A fast MicroVM with GPU sharing

Using my transit card data to create a year in review experience

Virtio-nvgpu: Near-native Nvidia GPU access inside a KVM guest

Scientists build most accurate atomic clock

AI Has Cracked the Most Diabolical Problems in Math. Why Can't It Solve Chess?

lm-detector: Model fingerprint detection on Web and CLI

SnakeCharmer: Fuzzing Harness Generation for Pure and Hybrid Python Libraries [pdf]

Making my vibe-coded app best as possible (I am perfectionist), umm for 0 users