Packed Data Support in Haskell

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

77•matt_d•7mo ago

Comments

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

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

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

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

cstrahan•7mo ago

No, one example of why being variable sized integers.

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

carterschonwald•7mo ago

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

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

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

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Last Call for Mass Market Paperbacks

DARPA GO: Generative Optogenetics

Rive in React Native – The Good, the Bad and the Janky

British Rail Sandwich (Wikipedia)

Ask HN: Can someone explain why Meta makes such bad design decisions?

The Eerie Parallels Between AI Mania and the Dot-Com Bubble

SpaceX Starts a Wall Street Bake-Off to Hire Banks for Possible IPO

Neuroevolution of Augmenting Topologies in JavaScript

Ask HN: Is starting a personal blog still worth it in the age of AI?

JavaScript Engine Security in 2025 [pdf]

Discover the best websites you've never heard about

Evalite: Evaluate your LLM-powered apps with TypeScript

Show HN: Gradient.bg – Aesthetic Gradient Generator

Show HN: I vibe coded a vibe marketing platform

CCTV appeal after museum artefacts stolen (in UK)

UEmacs/PK 4.0: Full screen editor based on MicroEMACS 3.9e

Musk's Last Grift

Nokia: The Deep Fall of an Industry Giant – The Rise and Fall of Nokia Mobile [video]

History of Declarative Programming

Trying out KOReader and Wallabag (the first few days and months)

Where Is GPT in the Chomsky Hierarchy?

Show HN: Add keyboard shortcuts to any site with a browser extension

OpenAI Ends 'Vesting Cliff' for New Employees in Compensation-Policy Change

Rat Dystopia

BA fears a future where AI agents pick flights and brands get ghosted

Sloot Digital Coding System

Will Larson Reflects on Staff Engineer [video]

Protect Earth creates and restores woodlands, meadows, and hedgerows in the UK

Codewave

IBM: What if quantum computing is as fundamental as the origin of zero?