Packed Data Support in Haskell

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

77•matt_d•12mo ago

Comments

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

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

Zolomon•12mo ago

They mention this in the article.

spockz•12mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•12mo ago

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

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

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

lordleft•12mo ago

This was very well written. Excellent article!

NetOpWibby•12mo ago

Is this like MessagePack for Haskell?

TurboBird – Firebird Database Tool

Google Plans to Invest Up to $40B in Anthropic

Show HN: Kadō, an open source habit tracker app for iOS

Visual-base is a second brain from your eyes

I Cancelled Claude: Token Issues, Declining Quality, and Poor Support

Is the Novelty Budget Dead?

PGO Build TPC-C Analysis MariaDB v11.8.6 TideSQL

LLMs – What Experienced Practitioners See

Ask HN: How does Google crawls x.com website?

Games for Change

What Anthropic's Mythos Means for the Future of Cybersecurity

Refuse to let your doctor record you

Space Reactor 1

Intel stock hits new all-time highs for first time since 2000

Content credentials – hardware signing of photo and video cameras

Why I'm Done Making Desktop Applications

Six things I'll remember when I think about Tim Cook's version of Apple

UK Biobank health data listed for sale in China, government confirms

What I learned asking 11 AI models to grade each other's AI predictions

Why High-Testosterone Men Don't Perform for the Crowd

El Salvador Adds New Tools in National Health App to Track and Treat (DoctorSV)

Asia's Billionaires Are Bankrolling a Push for More Babies

Rubbing testosterone gel on men's upper arms eliminates the audience effect

Show HN: Tarot Down Detector – a status page as a tarot reading

The Design of Design – Gordon L. Glegg(1969)

You know what consciousness is: you live in soul land

Unfounded Health Concerns Are Powering a Solar Backlash

Printing a Check for Free

Ask HN: Anyone else get fatigued by interaction with LLMs?

Show HN: PrivateClaw – AI agents running in confidential VMs you can verify