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?

Unofficial List of Siri Commands

Businesses can claim refunds for tariffs declared unconstitutional

The great Scouse pasty war

NASA working on 'Big Bang' upgrade to keep the Voyagers alive for longer

The Interpretive Advantage [video]

Anthropic's in-house philosopher thinks Claude gets anxious

Prometheus Exporter for RDMA (RoCE) NIC Statistics in Linux

Convert WebP to JPG Online Free

Eyelash-Filter

Discovering Prince, Ten Years Later

Why Honcho solved my agent memory problem

Cheap Batteries Are Taking over the Power Grids

Off Grid: mobile AI with GUFF files or an API endpoint

AI Researchers' Views on Automating AI R&D and Intelligence Explosions

PostgreSQL MVCC, Byte by Byte

The Melancholy of Subculture Society

The power shift: Why the future of the electric grid will be software-defined

Proving open source is ready for the industrial edge

Hook It Up to the Machine

Vale Observability Metrics

A Thought on Bias, Power, and Decision Making

Spiderman Phishing as a Service kit explained (again)

Atomic Design

Is It Down or Is It Just You?

FreeCloud: Use your excess web hosting space as your own cloud drive, with sync

Show HN: Real time Apple Notes sync to cloud

Burn Slim: Targeted Weight Support? [pdf]

French prosecutors summon Elon Musk, alleging X child abuse images, deepfakes

What Agent Orchestration Changes

Flagship: feature flags built for the age of AI