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: CheapStack – affordable dev starter kits and boilerplates

Algorithm Aversion

Fable is stylistically closer to Kimi K3 than Claude Opus

US administration considering ban on Chinese open source AI models

The Messy Reality of AI Transformation

Jan – Open-Source ChatGPT Replacement

The Cartel Olympics

Donation Controversy

US imposes new 50% tariffs on some Canadian products

You're not ambitious enough with Claude

Pregnant Womans Roadside Death Triggers Push to Reopen Mississippi DeltaHospital

Tell HN: TIL accessing old.reddit.com now requires accounts

Designing an Ethernet Switch ASIC

Show HN: Seek – Ctrl+F for Videos

Parsifal and The Muppet Movie are the only two genuine Gesamtkunstwerke

My falling-out with the rationalist community

Show HN: Velprium - Time Workspace

Mysterious little red dots at the beginning time may have an explanation

Ramp AI Router

Poverty of attention. Text became free. Attention didn't. (German)

Repos in 29 days with an AI pipeline – what broke wasn't code

US judge approves Anthropic's $1.5B settlement of copyright lawsuit

Free LLM balancer combines multiple local inference machines with cloud fallback

DeskPad – Virtual Keyboard and Mouse for Android Desktop Mode

Confront Reality (2012)

An Ode to the Old Ways

Richard Hamming: how one frustrated mathematician made data repair itself

Did California's DMV Director lie to the legislature?

New Orleans Cops Published Policy Document Allowing Weaponized Drones

The depth problem with agentic research