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?

Richardson Maturity Model, Steps Toward the Glory of REST

Nvidia Launches Open Agent Safety Platform

Vite+ 1.0 Is Out

The Largest Roman Mosaic Ever Excavated Opens to the Public

Space X Startship first orbital flight

SlopTotal, a Self-hosted AI text detector that runs 23 open models

Geely to Buy 30% Stake in Rival Nio's Battery-Swapping Unit

Fingerprints of Jev

Why Software Factories Fail [video]

Intro to Clojure Workshop [video]

Is an Agentic Bank Run Coming?

My coding agent now records the demo video for its own PRs

#59 Hans Kelsen and Carl Schmitt: Friend and Enemy

Hospitals use AI to find more things to bill for. Insurers use AI to deny them.

Parisians on Hunt for Baguettes as Bakers Get Nod to Take Vacation (2015)

How NOT to detect residential proxies

Oracle triggers 'force majeure' on data center project over power delays

The case for Wile E. Coyote, engineer: how it shaped the way we build

Show HN: Skill that lets you run other Skills as Jinja templates

Corporate America embraces cheaper 'open' AI models

A Replacement for Bert: Introducing ModernBERT

Vanguard: Anti-Boost, Pro-Skill

Applying Deming's Continuous Improvement to Multi-Agent AI Systems

Show HN: Quick Decision - Select text, get a yes/no verdict (Jev)

RustFS 1.0 is GA after 2.5 years

Celebrating Sixteen Years of LibreOffice

Show HN: Onesie – An expressive CLI for System One models like Jev

Test-driving Jev on a security task: identity resolution

Glass of Water Theory

Georeferencing Chernarus and visiting in real life (2021)