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?

CMU Introduction To Deep Learning 11-785, Fall 2026: Lecture 1 [video]

Oldinsurancemaps.net is now a Charter Project

Rare polyamorous bird of prey's location has been kept a mystery

A privacy-focused PDF toolkit that runs in the browser

Open Source Is Good Marketing

We're 15-year-olds tired of switching study apps, so we built our own

My Anti-AI Manifesto

Ubisoft forgot the actual game in Steam release of Heroes of Might and Magic 3

It's the People, Stupid (Human Art in a Company World)

What if AI were in charge of public policy and politics?

Open source in-browser log sanitizer, feedback required

RAG Is Simpler Than You Think

The End of Programming

How to Build a McKinsey-Style PowerPoint with AI: 8 Rules for Consulting Slides

Ask HN: Is what Open Commonplace legal?

Hister: A private, self-hosted search engine for the browser history and files

The Flood Came Without Warning: What Happened in Northern Nepal?

Bill Gates says we've passed AI's danger thresholds. Now what?

Gh omens: will GitHub go down?

More than 18000 questionable images found in antibody catalogues of 15 companies

Revolut Joins Global Stablecoin Race with Euro-Backed Token

Multilayer Network Backboning

SleepJEPA: Learning the latent world of sleep to estimate disease risk

'This is crazy. This is insane': Bill Gates has changed his mind about AI,jobs

A Drone Killed Three Ukrainians. It Was Guided by A.I

Drive-By Agent Hijacking: One Website Visit, Persistent Model Poisoning

Veryfront Code, the first full-stack AI framework

One sentence owns this page until you pay $1 more

Is this the civilization we really want? (2017)

WICG/Local-Peer-to-Peer