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?

Why Is It So Hard to Build a Transformer?

MidWestWhips

3D FPS Gaming on the Commodore PET [video]

Pfizer, Valneva Lyme vaccine starts review in Europe

Feel the burn: 90% of people heal faster by focusing on their pain – study

DOJ Official Flags Stanford for Scrutiny over Foreign Donations

The bitter lesson is the observation in artificial intelligence

Multi-stage distributed query execution in ClickHouse Cloud

Bluesky draws its logo on screenshots

scScript for Linux

Sailors on the USS Abraham Lincoln reportedly dealing with poor conditions

The Carrion-Eaters: What We Did to Jason Arday

Nation's Largest Reservoirs Are Drying Up, Threatening Life in the Southwest

DEF Con 33 – Kill List: Hacking an Assassination Site on the Dark Web [video]

Graphlib, a new way to create directional graphs

Twitch tested pausing ads until you return to the Twitch tab

Dirty Pictures – Full Documentary – Alexander Shulgin – Ann Shulgin [video]

Agentic AI in a Smolbox

Quake Shareware, a CD-ROM just a little too full

Try any open source model for free

Virgin Galactic wants your help naming its new Delta class spaceship

Samuel – mimic your speech using Pink Trombone with a model

Theodore John Conrad

Fairphone 6 and PostmarketOS working main camera

'Buy Now, Pay Later' Lenders Pitch Loans for Needs Like Electricity and Rent

What's behind the rise of teens spying for Russia?

Penny Pritzker Warns China's Rise in Research Rankings Is 'Not Good' for U.S.

Gitweb – Git web interface (web front end to Git repositories)

Tracking the BitTorrent Tracker Infrastructure

Control Charts Make AI Agents Cheaper, Less Necessary, and More Useful