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?

I did this without your knowledge

How Meta's Muse Solves CAPTCHAs on Google, Amazon and Cloudflare

International Caps Lock Day

Show HN: Pure-Rust port of bzip3 compressor. Format-compatible with C

Hetzner: PHP security issues CVE-2026-109618 and CVE-2026-109619

Write Moby Dick, approximately

Microlandia gets its own game engine

Hugging Face's New AI Biology Model Lets You Chat with DNA

Ruby Prism Release v2.0.0

Palmer Luckey on X: "Immigration policy must be driven by the present

Jumping Worms

How Japanese Dried Bonito Is Made

Talking to the robots (my first encounter with an AI agent)

What 1,866 popular GitHub projects tell their AI coding agents

Show HN: Bliss Writer – Screenwriting TUI Built with Roc

Why are all LLMs Obsessed with Japanese Culture? [pdf]

I built a game where you create a CPU from logic gates

How Do AI Agents Remember Things Across Tasks?

Copy, move and clone files in APFS, a primer

Artificial versifying: a new way to make Latin verses. (1678)

Barclays to cut 5k jobs as bank's bosses hail AI productivity advances

Google Humiliates Indian Developers with Google Play BillDesk Verification

For a brief generation or two, we clicked

Launchpad DockerHub Ubuntu Dockerfile Links Error

I don't trust ON DELETE CASCADE

Show HN: Return Ledger free portfolio TWR/XIRR tracker with AI PDF import

Several Linux kernel vulnerabilities accidentally posted to public mailing list

A bank statement can carry hidden orders for an AI

Show HN: GoRoute – Native Go LLM Gateway for Coding Agents (< 12MB RAM)

AI's hidden storage bill: What inference leaves behind