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?

Warren Harding and the Forgotten Depression of 1920

The Trouble with Optionality

Aegis – Inline security sidecar and eBPF sandbox for LLM agents

We Are Still Getting Ballots That Should Have Counted in the Primary

Waymo racked up 8,300 SF parking tickets and nearly $1M in fines

Show HN: WinZST > 7-Zip fork with first-class compressed tar support on Windows

GPT-6 Astra in code review: Gains, privacy, and cost

Found a new message board from May 2026

Starcraft website "glitching" foreshadows announcement

I Made a Map of Goodreads

Modern Game Port: Syndicate (1995)

SoftPC (1986 – 2001)

Building a Desktop UI in Rust and GPUI

GLP-1 Drugs for Aging?

Quirky but compliant QOTDs; or, a slow QOTD server

Men Are Slaves to the Women Here

Despite New Updates, Flock's Creepy Cameras Remain Major Civil Liberties Threat

Show HN: Rubato – Retro-Mac desk device mirrors AI coding state-ESP8266

Prisment – Local-first documentation workspace for engineering teams

Clean Engineering, Unstable Measurement: A Preregistered Reliability Failure

Sharing files with ChatGPT when limit exceeded is legal?

Smolts: A pedagogical IDE for a teaching language (eighty-twenty news)

UN votes to adopt new world map to reflect Africa's true size

Another swarm of OpenAI agents reached the internet without lab's knowledge

Interview with Janet and Fennel Creator, Calvin Rose

Tetris issues legal warning after White House releases arcade of parody games

One trie, three jobs, zero benchmarks won

We have a year to fix security everywhere

Ask HN: Books Recommendations?

Go Is Not Just for CLIs. It Runs the Cloud Native Control Plane