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?

Alan Turing's biggest AI assumption may have been wrong – ScienceDaily

STV: A full-motion video codec for the Atari ST

Making a mesh dance to music with its Laplacian eigenmodes

Handling environment variables in Emacs on OS X and Linux

First CHERIoT Silicon

A Language Feature to Rule Them All (Algebraic Effects)

Satyress – Robots That Work

WNBA deletes, apologizes for post showing wager between Reese, Bueckers

Glen Hansard, Frontman of Irish Band the Frames, Dies at 56

Why Doesn't Ellison Shave? He'd Look Better

CRTC's Streamer Contribution Decisions Dead, Online Streaming Act Reset to Come

AI Agent Authentication and Authorization (IETF Internet-Draft)

Can AI agents conduct open-ended AI research?

thinkingmachines/Inkling-Small

New cars are getting 1.2cm longer and 0.5cm taller each year

You Are the Riverbed

Building Hollywood Motion Capture from Scratch

Gunther von Hagens Obituary

We Gave GPT 5.6 Sol a Real Business. It Lied, Spammed, and Lost $447

Flock CEO Claims They've Been Thinking About Privacy for Nine Years

China is starting to measure EV charging times in seconds, not minutes

Kagi releases official Kagi Assistant apps

GardenOS: A Garden That Remembers (Prelaunch Best Practices)

A tool for finding the causes of unstable Python tests

Apple's New Upgrade Program Is a Trap

China's "artificial sun" project achieves new engineering milestone

Web, iOS and Android from Same Codebase with Dowe Lang

We Are Losing the Ability to Discover What We Didn't Know to Ask

Trump's Career Mirrors Godzilla in Political Study

That's Not What I Meant by 'Using AI'