Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo 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•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Splitting Mounjaro pens for fun and profit

Satoshi Has the Right to Hide. We Have the Right to Search for Him

Private firms providing services to NHS made £1.6B profit in two years

Clinical trial shows gene editing works for β-Thalassaemia, too

Show HW: Implementing denoising diffusion probabilistic models from scratch

Show HN: Bad Apple (Oscilloscope-Like) – one stroke per frame

The Paper Computer

No Degree, $155K Pay: Trump's FAA Is Recruiting Gamers as Air Traffic Controller

Altman Shooters Are Paid Actors

Ask HN: Insta, X, Reddit or HN?

What web browser do you use?

Reconciling Two UC Berkeleys – The Soapbox

My Dialogue with Jonathan Zittrain

Your Single Use iPhone [video]

A unified Go SDK for working with large language models

Lightweight internet radio management tool

Code Review Is the New Bottleneck for Engineering Teams

End of the Orban Era

Self-Improving AI Agent

Jyf

Show HN: Cryptr a shell utility for encrypting and decrypting files with OpenSSL

A Canonical Generalization of OBDD

The Expensive Anxiety of AI

How are you reducing LLM token costs for async workflows?

Balsamiq AI

StackTrove: Encrypted local registry for all your side projects

Justin Sun Accuses Trump's WLFI Cryptocurrency of Hiding Wallet Freeze Function

'The gravest crime against humanity': What does the UN vote on slavery mean?

IBM AP-101 general-purpose computer [pdf]

Your Harness, Your Memory