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?

Git Internals – Plumbing and Porcelain

Why Your Emacs Terminal Is Slow and How to Fix It

Ada & Zangemann book about free software translated in Persian / Farsi

The Life of Death and the Enshittificator [video]

Unbiased is our platform. Pareto is our own blended AI model

Anthropic says its model Claude is helping to build the next version of itself

Show HN: Attar – Compile React apps to native machine code

AI software should be treated like any other software [video]

The early days of Unix in the UK

World Money: A Financial Super App for Humans

War may be coming. Are we psychologically ready?

The LLM Comments Are Not for You

iCloud+ Now Includes Apple TV and Apple Arcade

Relax for the Same Result

Phone coverage across the London tube sent me hurtling down a tunnel of despair

Using steal time to moderate CPU demands

A Pause for the Python JIT

Show HN: A web page that counts its own visitors and cannot lie

Jev is trained on 100% synthetic data

Show HN: Fouine – local full-text and semantic search for scanned PDFs on macOS

What to Expect When You're Expecting (A World of Multi-Agent Systems)

Dxui – A declarative desktop GUI framework for Go, without cgo

Hugging Face attack: "This might be the clearest warning shot we ever get" [video]

Eight language models and the 2026 Berlin state election

Cassette-shaped MP3 player meant to be played on tape decks [video]

FeatureMap – map your product's features

Why dynamic balance matters at 1200M/min

Gyazo screen capture tool confirms data breach

What to Read to Stay Grounded Amidst AI Doomerism

The Entity Service Antipattern