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?

Conductor's shutting down on the 20th so I built an alternative (founder, AMA)

Anthropic secures $3.4B generator deal for AI data centers

Trying to outsmart the Apple News algorithm

AI learns from the products of thinking, not thought itself

The Origins of Peanut Allergy

Four Useful Questions

Show HN: An Ad-Free, 100%

Detecting signs of hypertension using wearable sensors

Show HN: Huobidex – A handpicked hub for tools and products

A digital bank's collapse toppled Paraguay's president

View / Nvidia's $4.5T test of founder immunity

AO3's outage has been a boon for Tumblr, especially among Gen Z

Humans' Origin Story Is Being Revised [video]

The Collision: What AI Does to Us

Nvidia CEO Affair with Chinese Spy

Show HN: clap.cpp – Audio embedding inference in C++ (GGML)

Why MariaDB is giving financial services a cache of its own

Elegy for What's Left of the Normal

Show HN: Flide: Make Jev-like decision models up to 9.5x faster

Michael Burry's public calls would have played out

Hide your slop PR descriptions behind <details><summary>

Show HN: A diffusion model that runs in pure CSS, no JavaScript

D200mm: A New Scale for Single‑Crystal Diamond

The bonus that makes employees more committed

I Resist Generative "AI"

Best-Effort Extent-Same, a btrfs dedupe agent

Show HN: Just Dashboard, an open-source VPS management dashboard

Cryptocurrencies slide to two-month lows after US midterms

Slavdom Unearthed: Marian Wawrzeniecki's Neopagan Paintings (1891–1923)

Pay per pre-configured GPU hour or per token for open-source LLM inference?