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: Reges Town – a 3D city run by AI citizens, in the browser

Ocarina of Time (Switch 2) PC Recompilation

I Love the Smiths AI: A Familiar Elevator Scene, with You in It

The Maya used so much red paint that they poisoned their water with mercury

Addressing protocol security gaps in multi-tenant Kubernetes

NHS breach helpline left staff carrying a 'significant emotional burden'

Ships loiter near subsea cables amid Iran's warnings to Trump

British soldier ignored order to pull his SIM card, then got blackmailed

Good Night, and Good Luck: AI, fear and what the job data says

A Quantum Theorem Has Killed Einstein's Reality

Goodbye Duolingo: a new Italian Teaching App

Goodbye Claude, Hello Pi

Obituary for a Computer Magazine

Show HN: I'm 15 and my personal website looks like iMessage

I Build Qorqbot – OS Grokbot

Anthropic warns that it's close to RSI capability, a.k.a. self-building AI

Show HN: LLM weight editing tool made by a 15-year-old

Microsoft Removes PC-to-PC Migration from Windows 11, Pushes Users to OneDrive

The Story Behind Edward Hopper's Iconic Painting, "Nighthawks"

35 by 35 electrification is the agenda for COP31

Why mandating AI use in the workplace can backfire

DFIR Level-0 Protocol: Sanitization of UEFI Bootkits and Linux Rootkits

AIG Mistakenly Locks and Erases iPhone and Cannot Resolve After 3 Weeks

Super Mario 64 on the Atari Jaguar [video]

RuneHQ – A Tribute and Farewell

Streaming Sites, Endless Content, IDK What to Watch

Claude Watermark Text

Consumer brain wave headsets threaten privacy

ZapFast: A fast, native WhatsApp client in Rust and egui

My $2k Chinese Electric Truck: 5 Years Later [video]