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?

Show HN: Clinch – exit-intent discounts for Shopify with a built-in holdout

Building Neon Object Storage

OpenAI researcher Naomi Bashkansky resigns to build AI that can read thoughts

The Knowledge Graph Gives You the What. The Why Was Never in the Folder

Wildfire-Driven Deforestation Rates in California Among Highest in World

Running Linux on Baochip-1x

Use local Chrome as a search API for coding agents

Canaries in the column? AI exposure and the UK's hiring slowdown

Securing Agents Across Perplexity's Client Endpoints with Numbat

Jeff Dean's Discovery Loop Should Automate Chip Design First

Why It's Normal for Children to Be Demanding

Put Your Money Down, They Say

Why 'super movers' have healthier brains – and how to be one

The Ambition Project

The Binmen of Birmingham

Tesla, SpaceX confirm 'Terafab' chip fab site – $16.8B first phase

I'm proud to open-source Capty today

Weak-to-strong generalization (GPT-4 Turbo was Pareto-SOTA)

A Peer-Reviewed Crypto 2026 Paper Gave ML-KEM's Foundation a New Quantum Target

I Am Going to Hit AI with a Hammer and See What Happens

DeepSeek Plans 'Significant' Price Increase for Its AI Services

Blue Origin narrowing in on root cause of catastrophic rocket accident

Contextual embedding in RavenDB (or how to save 220M USD)

Is there room for a coordination layer alongside event sourcing?

David Bessis – If AI does the Science, what is left for us? [video]

Safety fears as scientists make first viruses designed by AI

Cultures of Programming: A Companion Exhibition to the Book

LLM DeepSWE Pareto Frontier

Qwen3.8 Max now ranked as the best overall model by agentic index

Plumb a PDF for detailed information