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?

TaskMitra – A free task management app for small teams

After enshittification of the internet, is enshittification of products next?

Khelo24Race – Explore Bikes, Motorcycle Guides and Racing News

Awesome HN: The sites that mine its comments for picks

Jobox CTO is in the news for fraud again

LLMs tested on historical prediction markets, NONE outperformed the market

Tiny Pickles: Why are AI companies investing so much in math proofs?

How North Korea is laundering the $6.4B stolen from Binance

Tencent Hy4

US midterm elections 2026: live results from Senate, House and governor races

What Stable Rust Stands On

AI stocks slide as Texas governor result raises data center risks

A400000 Winners

Mistral Large 4 on AlphaXiv

AI assistant which get Advice from relevant humans

Affinity for Linux is in active development

SuperCalm – Minimal Phone for Android

Show HN: Readfirst – a repo map your coding agents read before they edit a file

Computerized clairvoyance: psychics push back against AI-generated readings

Multi-Token Prediction Done Right

Democrats Capture Congress Majority

Stop Hardcoding Your Timeouts

Ask HN: Is the CVE surge about finding old bugs or writing new ones?

Saving the Social Web

Canva to cut or relocate 22% of global workforce

Where Residential Proxy IPs Come From – AMA with Massive's CEO

SpecPilot: Autonomous Algorithm Discovery and Systems Optimization for SpecDec

Cahiers pour l'Analyse: Online Edition (2010)

US midterms 2026 election results

Valve Steam: Updates to the Pre-Release Review Process