Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•8mo ago

Comments

nine_k•8mo 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•8mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•8mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•8mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•8mo 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•8mo 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•8mo 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•8mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

EU and Mercosur countries sign landmark free trade deal

QWED AI – Open-source deterministic verification layer for LLMs

A look inside prediction markets

Emoji Design Convergence Review: 2018 – 2026

ICE To be abolished under new proposed bill

The Art of Thinking on Paper by Joanna Wiebe

Show HN: Kirkify – Fast and cheap face swap for memes

Applications of the Geometric Mean (1999)

IOU Wallet – keep track of what you owe and are owed through P2P underwriting

Redshift Files: The Hunt for Big Data (2024)

'Ideal Customer Profile' Is a Hallucination

Optimizing for Agents: The End of the Ten Blue Links

Storytelling Is a Lossless Compression Algorithm for Sales

Event Destinations Initiative: A model for event interoperability

Scalability But at what COST? (2015) [pdf]

Sed-bin: a sed to C translator written in sed

Technical Practices That Drive Business Results

ClickHouse vs. StarRocks vs. Presto vs. Trino vs. Apache Spark

A free and open-source rootkit for Linux

Consent-O-Matic

Skill gives you power. Taste decides how you use it

Robin Hood hashing for modern audiences

Daniel's first 20k curl commits

Not-Such-Better-Living Through Chemistry (2023)

Show HN: iTerm2 MCP Server – Let Claude see and control your terminal panes

File over App: 20 Years of Knowledge Management (Swiss Digital Days 2025) [video]

The Theory Underlying Concept Maps and How to Construct and Use Them (2008)

A vector-based cognitive protocol (OSF archive)

Pentagon readies 1,500 troops to possibly deploy to Minnesota, US media say

Show HN: RLM-Toolkit – Secure LangChain