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?

Looking for a tech job is a helpless data-entry nightmare

Show HN: MouseChase – A place-and-run puzzle game

There are now 5 inference providers for abliterated DeepSeek

Kickoff – A keyboard-driven live football scoreboard in your terminal

AI Enabled Private Equity

Tailscale SSH: Investigation and remediation update

Journal of Agentic Meta Algorithms

Don't anthropomorphize big tech companies

The Non-Negotiable Pattern – When Our Progress Becomes a CosmicOrigin Compulsion

Why AI coding tools assume a clean slate

Serbia's Student List preparing for talks on forming government

Three Levels for AI Agents: The Repo, the Company, and the Developer

Tech market feels like a data entry job

AI and the Collapse of Capitalism

Microsoft offers buyouts to around 60k employees to contain costs

Microsoft offers voluntary buyouts to 60k employees

Nvidia's AI showpiece: Jensen-mania, robot ducks and neocloud distress

Periopolis is a 100% Carless City – Build it Yourself

Quasiturbine Chainsaw

Live captions and translation for any Windows audio local

Create and edit images with a collection of easy-to-use AI tools

Inside Real-Time Systems

Why I'm Swapping Copyright for a Creative Commons Licence on My SciFi Novels

Preview, edit, and collaborate on Markdown files natively in Google Docs & Drive

All 1,557 Google Open Source Blog posts live on ATProto

Kazakhstan Expands Compute for Its AI Future

Micron Taiwan increasing salaries for factory workers by 2.7X

Year Old Short Story Contest Sponsored by a Young Amazon.com [pdf]

Show HN: Handcrafted HTML-first framework that outperforms React

Data analysis of login/user data from FusionAuth