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?

Show HN: Quikdown – 17 KB bidirectional Markdown parser and rich-fence editor

Now that your newsletter is AI-generated, I've Unsubscribed

All 4,582 abhangs of Sant Tukaram, translated and theme-mapped with AI

Built a rival to the largest fanfiction platforms – alone, at 17

Where Do India's IPO-Bound Founders Come From?

Show HN: Show HN: Kage – A framework to AI agent collaborate memory

Improvements to Std:Format in C++26

Windows UI evolution: Clicking an unassociated file

The Omnipod 5 insulin pump has been cracked by open source developers

Continuous Quaternion Delta Encoding

Ethereum: Still Chasing Sovereignty

See if you are in the weights of super intelligence

Ask HN: If AI didn't exist, what would you be building today?

The Pneumatic Tube Mail System in New York City

The 100k Whys of AI

Show HN: Image Tools Hub – A Curated Directory of AI Image Tools

Systemd v261 Released

SUV buyers undeterred by warnings of risk to pedestrians

Lo and Behold, Reveries of the Connected World (Werner Herzog) [video]

Proof of AGI is the impossibility of evals

Mark-of-the-web and pinning installers to sites

The videogame market is as big as ever, with PC leading growth [pdf]

Earthquake gate stopping a San Andreas disaster under highest stress in 1K years

OCaml 5.5 Released

FFmpegKit NDK r26c patch and maintained Android fork

How do we prevent Bitrot?

Show HN: Shelve – Native macOS menu bar app that auto-organizes your Downloads

Ask HN: Would you let your AI coding agent profile and optimize autonomously?

He made your free video player run smoothly. Now he's doing that for robots

Principles and Practice of Deep Representation Learning [pdf]