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?

The Luna-cy of getting Lock The Clock done

New flapping robot swims and flies like a diving bird

Only 90s Web Developers Remember This (2014

Ask HN: How useful is Gemini for Google Apps?

Show HN: Tilion – Stealth Browser Infrastructure for Agents

Linear is always a lagging indicator

Why devs turn to Buildkite in the AI era

The politics of air conditioning in Switzerland

Ask HN: How's the idea of creating LinkedIn styled character profiles

Sets of Overlapping Circles

Batteries 'cheaper' than gas plants as data centres fuel turbine costs

Pioneers of Computer Graphics [video]

Casio FX870P Emulator

OpenAI's first hardware device will be a HomePod, but don't tell them that

QR-Swastika-Avoider

Audio Transport: A Generalized Portamento via Optimal Transport

LeMario: Training a JEPA World Model on Super Mario Bros

The Campaign to Kill American AI Runs Through San Francisco

The Chuwi MiniBook X N150

Buffett omits gift to Bill Gates' foundation after his Epstein ties disclosed

Kara Swisher: Important CEO straits [video]

How Are "Disconnected" Young Adults Spending Their Time?

What to know about 'explosive diarrhoea' parasite outbreak in US

Who Is America's Homer?

Book Prizes Don't Work How You Think

Twain Town, USA

Blocking internet on phones improves attention, mental health, and well-being

Foglamp Scan

The Music of Destruction

Intel's 18A node is officially space-grade