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?

Slack Code

Cross-vendor byte-identical inference for a 72B LLM (AMD MI300X vs. Nvidia H100)

Real Time SEC Employee Insider Trading Summaries

Ask HN: Anyone in Legal Tech Here?

Miss Lonelyhearts (1933) by Nathanael West

Is spending 10 hours marketing a 45-minute project a waste of time?

A Free ASCII Table

Where in the U.S. Are You Most Likely to Be Audited by the IRS?

Codeberg TOS Now Rejects Predominantly AI Repos

Anyone in Legal Tech Here?

Those Dangerous Bagels

Run SDK: secure eval for your agents

Digmenu – Digital Menu

Show HN: I built a spatial graph alternative to the algorithmic feed

Vidbyte Skills – Skills That Keep AI-Assisted Work from Becoming Passive

TikTok to pay $400M in landmark child privacy settlement

Binary Search Visualizer

Memory Ordering in CPUs

Show HN: Feral – one local brain with memory for your devices and apps

Try Omarchy as a native, hardware-accelerated app on an Apple Silicon Mac

Naegleria Fowleri

Visa Passage

And Realists Learn to Shoot

Check any NYC address for open landlord violations and 311 complaints

Dolly Parton's Imagination Library

The 5 Levels of Wealth

Humanoid robots beat human records in the 100m, half-marathon, and high jump

Ultra-slow messaging apps Carrier Pidge and Roost have taken off

Why Atari Failed

I Love SQL; I Hate SQL