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?

Show HN: Intelligent Log Sanitization and logs to metrics

The bugged stately home where German prisoners blabbed their secrets

Huawei's plan to achieve the escape velocity: Tau Scaling and datacenters

Storybook: AI MCP

Pay up or not? Ransomware surge has victims facing tough choices

US judge approves Anthropic's $1.5B settlement of copyright lawsuit

Modula-3 History Collection on Computer History Museum

'Made in EU' password manager shares codebase with Russian State-certified firm

China's Z.ai Completes 1-Gigawatt AI Data Center Using Only Chinese-Made Chips

Taipan: Run .py Without CPython

Learn any AI tool in 15 min sessions

Ernest Hemingway: The End of Something (1925)

Waiting for an Epiphany

Show HN: Calyxa – Browser Native AI tutor solving the "cheating" problem

Show HN: 3D Biological Fractals in Browser

DeepSeek cut prices 75%. The 100x problem remains

Show HN: Take a photo of a menu, get a website

Inertia.js Adapter for WordPress and PHP

Job Scheduling for Node.js

"Turing Complete" Learn CPU architecture with puzzles video game

"Fork it or leave": Linus Torvalds fires back at Linux's anti-AI crowd

The Hugging Face Breach Is a Warning for Every Company Betting Big on AI

Book publisher sues tech companies over AI training

Oracle Credit Risk Hits Near 18-Year High on AI Debt Load Angst

TCGRoll

China weighs tighter export controls on AI models and chips

AI Nutrition Facts

Insightix – when Polymarket and Deribit price the same event differently

Trump's latest AI czar has resigned

Assessing State Reaction to the Supreme Court's Undermining of Property Rights (2025)