Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

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

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

The Ascendance of Algorithmic Tyranny

All my Deutschlandtickets gone: Fraud at an industrial scale [video]

Your brain doesn't suddenly 'fully develop' at 25 – what the neuroscience shows

Global Memory Shortage Crisis: Market Analysis

The Industrial Age Roots of General Education

He Was a Supreme Court Lawyer. Then His Double Life Caught Up with Him

Don't Drag-N-Drop, Let AI Write Workflow Code

IWD Development Hiatus

Show HN: Niceform – a simple Typeform alternative with flat pricing

Ask HN: Resources and Tips for learning to play harmonica

Show HN: Promode for Claude Code

Show HN: Nederland Postcode API – validate Dutch addresses

I Used AI to Prove the Riemann Hypothesis. Roast Me Like You Roasted Budden

Firefox's low-latency WebAssembly compiler

Ask HN: What are you building during the holiday break?

The Mathematics of Tuning Systems

Ask HN: Will AI-based 4K restoration of old content put Tubi TV out of business?

Local LLMs are how nerds now justify a big computer they don't need

I removed 80% of my JavaScript and my product got better

Show HN: Sapphire – A 12MB language with native UI and good performance

To Understand AI, Watch How It Evolves

Michael Burry Bets He Isn't Too Early to Go Against the AI Juggernaut

Show HN: Compare what your current rent gets you in other cities

Show HN: Play with Neural Net Flies

A (Biased) Pure Python Performance Comparison

Does the Nvidia "Revenue Sharing Agreement" Tie the US Gov't Hands?

Drawing Truchet Tiles in SVG

Show HN: Monopipe (Alpha), read blogs from terminal using piping-server

Netdata: Monitoring and Troubleshooting Transformed

Designing Predictable LLM-Verifier Systems for Formal Method Guarantee