Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

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

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

Design Systems for Software Engineers

A Pail of Air (1951)

Anthropic's official plugin gets the core principle of the Ralph Wiggum wrong

Dropbox changing policy: Now threatening to delete files over storage limit

Tell HN: 1B Jobs on GitHub Actions

Cacoco: Sbardef Editor Written in Rust

Show HN: I lost €50K to non-paying clients, so I built an AI contract platform

Ask HN: What to teach my kid if AI does math and CS?

Show HN: First professional-grade AI fonts

FLUX.2 [Klein]: Towards Interactive Visual Intelligence

Researchers use Apple Watch to train a disease-detection AI

How local network privacy could you

Researchers find trees could spruce up future water conservation efforts

From Blobs to Managed Context: Why AI Applications Need a Stateful Context Layer

Latency Monitor: lightweight tool for TCP and UDP monitoring

Is a billion dollars still cool?

Wikipedia signs AI training deals with Microsoft, Meta, and Amazon

Pokemon Friends: a scam with cute characters

Protest Movements Could Be More Effective Than the Best Charities (2022)

Training large language models on narrow tasks can lead to broad misalignment

Supercharge Your Bun Workflow with bun-tasks

Can LLMs Express Their Uncertainty? Not

Quest for a drug that lowers an artery-clogging particle nears finish line

What is the business behind publishing AI models?

Building software with AI loops: 12 observations from Geoff Huntley (Ralph)

Using Replit and Cursor to build the same app

Self-Evolving Search Agents Without Training Data

A Pathway to Privacy from AI – while using it?

Secure containers market: from men's room at Taylor Swift concert to NBA finals

My Opinion on Spelling Run Time vs. Run-Time vs. Runtime