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?

Five-year-old Nvidia A100 servers sell for up to $82k in China

Undermining the Market

Disguised Russian banking apps topped US App Store again

Show HN: ccMarvin – Just Email with AI

How Remote Work Has Helped a Generation of Working Parents

Introduction to Making Makefiles

Brazilian judge sentences parents to prison for homeschooling their daughters

The emergence of the web data infrastructure layer for AI

Computer use in Gemini 3.5 Flash

Show HN: DBOSify – Drop-in Temporal replacement built on Postgres

2026 EuroLLVM Developers' Meeting Talks

A way to detect AWS/Terraform drift

Utah's largest solar and battery storage project is officially online

Chinese supercomputer tops US models in global ranking

Ask HN: What would you most like to see improved in the Claude Code interface?

Show HN: Follow the Thread – a calmer, typographic way to read Wikipedia

Indian-App-Food-Stress

Windage – free browser remake of Scorched Earth

Fwupd 2.0.21 Brings Fixes for More Than 250 Potential Security Issues

Rust Commercial Network Launches to Bring Commercial Rust Users Together

Ebola confirmed in France: Officials report first case of eye-bleeding disease

LLM Research Is Fake

Security Is Inherently Political

Flock CEO: "They're Gonna Enforce Immigration No Matter What Flock Does"

Ubisoft co-founder Claude Guillemot dies in plane crash

Where might we find life in our solar system?

Cerebras CEO says margin forecast misunderstood as stock plummets after earnings

Microsoft's quantum computing technology called into question, again

Trump cancels bipartisan housing bill, reiterates demand for SAVE America Act

Raspberry Pi and the EU Cyber Resilience Act