Packed Data Support in Haskell

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

77•matt_d•7mo ago

Comments

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

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

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

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

cstrahan•7mo ago

No, one example of why being variable sized integers.

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

carterschonwald•7mo ago

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

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

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

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Show HN: Async version for Rust std::sync and more

Safepay: Jobs get done. Payments get released. No stress, no surprises

Verbal Knobs. We owe the answers we proxy

Candy Desk

104 elite skydivers set world record in physics-defying formation

Show HN: Cryptopp-modern – maintained Crypto++ fork with BLAKE3, Argon2, CMake

Built a Free, Unlimited Screen Recorder Because Everything Else Annoyed Me

Microsoft CEO taps advisor to 'rethink' the company's business for the AI era

Baikonur pad damaged in Soyuz launch to ISS

"Disagree and Let's See"

The Writing Is on the Wall for Handwriting Recognition

The Gist of Western Philosophy

Tkr.life

Tell HN: Regrets. Think carefully about how you spend your time

Explosive Skill Acquisition

My Seeker Phone

Stopping bad guys from using my open source project (feedback wanted)

Easily duped by his Stanford veneer with O realizing he's a CCP mouthpiece

The Beguiling, Misunderstood Theremin

EU to Target Apple Maps and Apple Ads Next

Couple allegedly used hidden camera, earpieces to win $1.18M from Crown casino

Meshtastic

YouTube Recommendation Algo

A new Little Prince museum has opened its doors in Switzerland

Software Is Not the Service

What's the Deal with Euler's Identity?

ASML Got EUV Lithography

Sega Master System: Fancier Tile Graphics

A Circle in the Hyperbolic Plane

Monero Subaddresses