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?

Drilling starts on a seafloor geothermal well off Oregon

How to Build a Bain-Style Consulting Slides with 10 Decision-Making Frameworks

Project Cyan

Show HN: Northstar web browser 1.0.11 released

A mysterious organ in the sperm whale's head gives it the power to sink ships

The Cosmic latte is FFF8E7

'Breaking Bad' Became the Best Show of the 21st Century [video]

A glimpse into life inside a child prison in France

Flowlight – open-source network visibility for AI agents on macOS

Fframes – GPU first video vibe coding framework with 5 years histroy

Foundations of Large Language Models

Turning Failure Postmortems into SRE-Benchmark Problems

Looking for Things to Do in Bangalore?

SpaceX – Starship Flight 14

War Bros Didn't Always Rule Silicon Valley

Decentralized P2P app with you in the center of a WebTorrent Venn Diagram

Ukraine's new military AI does more than watch the battlefield–it helps commande

Open-source AnyPS5 dumps emulation to run PS5 games natively on PC

SevenDB: Reactive yet Scalable

World United Blastoff

Stop Asking "Saga or 2PC." Start Asking What Each Operation Needs

Australia's Waratah Super Battery Now Operating at Full Capacity

How the stories about all-powerful AI are swallowing the world

Comics RSS: RSS feeds of comics

Ask HN: Do you think AI agents can escape human control?

OpenAI pauses training of latest models

What a black bear is: 30 claims, checked against primary sources

What Happened to the Coronagraph?

Australia Senate Requests OpenAI, Anthropic CEOs Face AI Inquiry

Thinking Fast and Slow in AI: The Role of Metacognition