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?

Time-based one-time-password authenticator for Game Boy

Show HN: Reflex – A GGUF-native Rust/CUDA engine for scale-to-zero LLM routing

Americans earning $100K are struggling. This breakdown offers clues as to why

How Do Cuttlefish Hide?

The steps to finding, developing and vetting news sources

Floor 404 – Backrooms Puzzle Game (Made with GPT 6 Astra)

Show HN: Practice for the new AI-assisted coding interview format

The Verification Inequality: Language Models as Opaque Intermediaries

Steam, the Trojan Horse of Linux Gaming

Hackers Breached U.S.-Bound Oil Supertanker

The new Go JSON API: twice as fast, or 1.5x slower?

Ask HN: What's the oldest software tool you still rely on every day?

A 23yr old intern translation trick led to ChatGPT

Show HN: KettleHour – free, no-signup rate and invoice tools for freelancers

RTSP vs. WebRTC: Choose Your Video Streaming Protocol in 2026

Optimism by Necessity

Astro Recommender

Show HN: Boole-1.7B, a 1-bit LLM that outperforms Bonsai-1.7B

Nutrition Desk – free calculators that show the maths behind every number

Nobel Prize for economics awarded to Hall and Woodford

Discover vibe-coded alternatives to popular software

Show HN: Cenntre – a creator-first platform for publishing and monetization

What Should Developers Consider When Building a WooCommerce Store?

Show HN: Tellcut – motion videos written as code by Claude, edited by chat

A thirty year durability ranking of 35 companies

Audit of OpenAI's Navier-Stokes Formalization: Weak Bochner vs. Clay Statement C

Quantum Genesis

Show HN: E2E – Open-source agentic testing framework for web, iOS and Android

Playing with Blocks

Recursive Self-Improvement Is Our Only Hope