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?

Trembling Photons in Non-Abelian Electric Fields

Would you get tattooed just to interview at a 7-days-a-week AI startup?

Palermo and the Citrus Kingdom

The end of roommates? Why young San Franciscans aren't living with each other

Flue 2.0

Schools installing pepper-spraying drones to help stop active school shooters

How to spot overlapping subproblems before you start coding DP

How we made a viral commercial for developers

World Models Are AI's Next Frontier

Coal back in favour as US plant bidding war highlights rising demand to power AI

Reaping the Whirlwind: Inside the Potomac River Midair Collision

Deliberate indifference: NY state put imprisoned man's life at risk, judge rules

The Old Man and the Strait

I Went to the Amazon to Fly in a 1942 Workhorse of Aviation

Show HN: I rebuilt my 2008 football/lineup site

How the Airbus A350’s Massive Landing Gear Is Built

The Least Private Operating System Ever Created [video]

I Filmed Plants for 12 Years

Microchip released XC compilers for free

Implementing PaxosLease in Python with HTTP Flask

Tailscale didn't stop the Hugging Face intrusion

AI companies destroy rare and non recoverable physical books

Maths shows why your vote may not count the way you think it does

I pretrained the best small model under 100M parameters

Temu is a comically bad app

The icons that might solve Hollywood's AI problem [video]

Temu App Launch Sequence

Nuclear Waste Cleanup: DOE Is Missing Opportunities to Apply Lessons

Flock CEO Admits Flock Alerts on People

Google pauses AI satellite images, after fears of deepfakes in the sky