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?

EU weighs restricting use of US cloud platforms to process sensitive gov data

Bieke Depoorter – A Magnum photographer exploring portraiture

Raw Truthful Nothing Hidden Musician Bares All with New Album

AI is everywhere. Deep study still worth it? No idea, but I will try

Nostalgic Electronics Kits Central

Human-Like Document AI

What AI Did to My College Class

The quiet grief of adult friendship

Meta deletes popular 1M follower account after Kuwaiti request

The occasional ECONNRESET

Americans Are Smashing Flock Cameras

The Protein Shortage Is Coming

A chat-less interface to collaborate with LLM agents directly from your files

Is the Modern NBA Breaking Its Stars?

Reviewing so called Pull Requests at $dayjob

Oto Smart Sprinkler Review (2026): Solar-Powered and Simple to Use

TinyStories-260K running locally on a stock Game Boy Color

Google Maps Satellite Imagery of Palisades Fire Area Reverts

Engineering a Safer World: Risk Modelling – and Safety Engineering? – For AI Lo

A Parliament of Owls and a Murder of Crows: How Groups of Birds Got Their Names

Getting Matured Through Learning

How Reese Witherspoon built $900M company from a problem Hollywood wouldn't fix

Rethinking the Luddites in the Age of AI

A Gentle Introduction to World Models

Where Have All the Cycles Gone? [video]

Show HN: Typeset sitelen pona and copy a PNG (for toki pona speakers)

Scaffold a complete 1990s Geocities-themed static website in seconds

Age Assurance on the Internet: Identity, Privacy, and the Limits of Verification

Bun's problem may be developing in the open

Polylux: Open-source replacement for Asus Armoury Crate that saves 470MB RAM