Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

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

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

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

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

cstrahan•9mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

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

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

Travelling with a man I'd known for two days changed my life forever

AI: The Wrong Kind of Bubble

What are the best AI focussed YouTube channels these days?

Unhashing All the Things: Making Sense of Ethereum Storage Traces

Superconducting nanowire memory array achieves significantly lower error rate

Show HN: Page2Profit – Find where your landing page is losing revenue

Reddit Lawyers Force Founder to Redact "WallStreetBets" from Miami Event

DocBabel – Translate books and long documents with AI

Injury to Buildings and Vegetables

Is It Dangerous to Let Kids Be Free?

The Next Thing Will Not Be Big

Made to discriminate: UN's Gender Inequality Index always finds women worse off

Codex Down

Clawdbot Changed Name

Windows is Ruining New Laptops [video]

Rags and Tools and Bellyaches

Show HN: Blink-Edit – Cursor-style next-edit predictions for Neovim (local LLMs)

TikTok investigating why some users can't write "Epstein" in messages

TikTok censorship claims spark probe of app's handling of anti-Trump content

Interview with Yafah Edelman about AI welfare

Toothbrush-activated powder whitens, repairs and protects teeth

Leaflet, standard.site, and open social publishing

Show HN: I built a local macOS dictation app using Nvidia Parakeet and MLX

Deep dive into the Maia 200 architecture

Gamers suspicious of AI content have forced developers to cancel titles

The Death of Hype: What's Next for Scala

V now has SSA, SSA => x64/ARM64 back ends, a linker built in V and a code signer

Show HN: Real-time meeting cost calculator

Clawd Bot Renamed to Moltbot

Implementing the Transcendental Functions in Ivy