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?

My Addiction with Trading Apps

Why It's So Hard to Add a Column in the Middle of a PostgreSQL Table

Meta Patent: Prescription Lenses That Project Virtual Screens into Your Vision

Show HN: A shareable World Cup 2026 bracket simulator with live results

With AI, researchers discover new way to detect sudden cardiac death risk

Computation Is Bound by Physical Laws: A Fact-Based Church-Turing Thesis

Quake in 13 Kilobytes

Foreign funds help make housing unaffordable: research

Holos: Device Is Your Fediverse Server

Writing and Code: Same Leverage, Different Story

Forward Self Models

Om

Trump threatens 100% tariff on European digital services taxes

Waveloop: What Fable Left Me

Ask HN: Anthropic Billing Issues?

Steam Controller auto-charge with computer vision tracking

A molecular seesaw drives healthy skin development: research

Darwin: Libsystem_malloc .dylib and XZone

Decker Fantasy Camp 2026

Understanding Ordinary Events

Speeding Up Ratchets with Resharp

The Church-Turing Thesis from the Perspective of Discrete Physics

Volkswagen reportedly planning to axe 100k jobs

Thomas Salme

Apple Internals: Swift in the Kernel

Revolut dials back remote work for graduates

Over 1/3 of households in Poland consist of one person amid demographic change

Retraction questions claim that cancer therapy works better in morning

Trump admin allows Anthropic to release Mythos AI model to some companies

US releases powerful Anthropic model Mythos to some US companies