Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•9mo ago

Comments

nine_k•9mo 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•9mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•9mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•9mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•9mo 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•9mo 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•9mo 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•9mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

SkyRL Brings Tinker to Your GPUs

Go! The AI Personal Operating System for Your Life

code-simplifier.md

An API for Your Brain

The consequences of task switching in supervisory programming

'A game-changer': UC San Diego professor initiates new field of medical science

Show HN: Alarm Arcade – an alarm app that only stops after you beat a mini-game

Expedition 33 art book confiscated because officials think it's an ancient relic

Adversarial Patch: images that make classifiers ignore other items in a scene

Opinion: NATO Has Seen the Future and Is Unprepared

Putin Didn't Know How Good He Had It

Elon vs. MongoDB- feature by feature comparison

Postgres Locks Explained: From Theory to Advanced Troubleshooting

Evolving Git for the Next Decade

Show HN: I built an AI that generates love proposals as pitch decks

The Women Mourning the "Deaths" of Their AI Boyfriends

This Is How A Child Dies of Measles

Exposure to Acrylamide and Trace Metals in Food: Still a Concern [France]

Iran internet blackout, turns the browser into a proxy

Lockdown Mode and Elevated Risk Labels in ChatGPT

I Didn't Want AI to Be Good at This

Looks Aren't Everything? Clavicular Begs to Differ

Olympic athletes push their bodies to the limit. Should we?

Superintelligence or not, we are stuck with thinking

A platform for founders to share ideas and find co-founders

Vulnerability scanner targeting logic bugs

X-raying OpenAI's unit economics

Long-Running Agents in Research Preview

LLMs Don't Read Code. Neither Do I. So I Wrote Redis in Machine Code

The United States Is Southern Now