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 billionaire threatening to upend Wall Street

Single-User Inference Card

SINR: Signal-to-interference-plus-noise ratio

AI Slop Is Real

Anthropic CEO says the way for AI to win over the public is to cure cancer

Show HN: Punyecs – A puny ECS library based on class attributes and querying

Frontier models, transparency and trust; a new golden age in research for some?

Show HN: TKeeper – OSS machine identities without a single point of compromise

Show HN: ChatGPT and Claude export viewer that runs locally in the browser

Ukraine Finds Nvidia AI Chip in New Russian Missile, HUR Says

Nobody Knows Anything

Off-Sprey

Apologia for the Old Ball

Smarter – open-source, declarative AI authoring platform (Django, K8s-inspired)

Sperm whales in 19th century shared ship attack information – Whales

Show HN: I Turned Apple Calendar into Tetris

Ghosts of the Past and Devils of the Present

Legbar – live AI agent sessions beside GitHub CI, in one terminal

Redis uses less RAM than you think, nibble measures how much, and applies it

Anthropic's 'Watermark' Text Adulteration in Claude Is a Perversion of Writing

Claude Seems Down

Failure Takes Years to Admit

Claude Is Down

Nauru, the 3rd-smallest country, changes its name to Naoero

Winkeys: Windows Keyboard Shortcuts on macOS

Show HN: One page per betting market – 21 books' odds, every outcome graded

How to build a RAG pipeline with the Go StdLib

Wellington second-hand bookstore's mysterious orders

My Hermes and Obsidian Setup and Use Cases

Awesome-local-first – A curated list of Local-First Software