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?

The Disappearance of the Public Bench

This Month in Redox – April 2026

Number of tokens shouldn't be the only metric

Audio-only minimal pair trainer using ABX methodology for language acquisition

Designing AI for Strategy Games Through Modding

I found a bug in the reality lattice

Syncweb, Literate Programming Meets Unison

Google Chrome downloads 4GB AI model to your device without permission

Untangling Entanglement: Does Science Support Physicalism?

AI-Induced Cognitive Atrophy

VLC, FFmpeg, Video Codecs, Assembly Programming (Lex Fridman Podcast)

Judge Halts Colorado AI Law After xAI First Amendment Challenge

Macro

Sting's eye-watering fortune that his 6 kids won't be inheriting

AI evaluation startup Braintrust confirms breach

ReleaseJet – the release notes tool for repos with many customers

Omega-3 supplements may be linked to faster cognitive decline in seniors

VirtualGL

SQLite Is a Library of Congress Recommended Storage Format

Show HN: I wrote a flight simulator in my own programming language

AI, Computer Literacy, and the New Divide

Rails Security, AI, and IBB

Firm solar and storage costs fall to $54/MWh, says IRENA

Solod v0.1: Go ergonomics, practical stdlib, native C interop

"Would It Matter If I Told You I'm Pope Leo?"

CSG: Why the Largest Military IPO in European History Is Combusting

It's time to test all adults for lipoprotein(a)

Claude Code wire trace reveals 13,000 words base prompt

Agile Is Dead. Long Live Agile

CrustAI – Private local AI assistant