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?

Deep Space Network Now

Chess Openings by Nationality

Show HN: Musql, JIT-compiled SQL, up to 300x faster than SQLite, 1000x vs. Turso

The Alchemical Transformations of the Mutus Liber (1677)

We Asked Starbucks Why Their 'Sugar-Free' Drinks Have Sugar

GoatedContext: Cross-repo, local preference context and cross-agent injection

How to keep learning in the age of LLMs

Experimental MSU-1 streaming and standard-memory profiles

Sharded, encrypted storage between friends over Yggdrasil

Designing for Voice-First

Show HN: Rgpu – a PyTorch device whose tensors live on a remote GPU

Show HN: Pareto Partisan? Relative Gains and Support for Public Policy

Show HN: Detangle, Dependency rules for JavaScript, checked in under a second

Thoughts on This Website Audit?

Is Criminal Forensics Bullshit?

Botanical Contact Printing

I mortgage my house so you can vibe code while pooping

Mistral Large 4 Preview: Intelligence, Performance and Price Analysis

Toketer – See what every AI prompt costs you, live in your editor

Show HN: KORA Doctor – find LLM calls your agent may not have needed

Show HN: Snug, a local-only bookmark export, import and backup extension

Gigabyte B300 Workstation PC

Crunchbase Data Shows AI's Most Active Startups Are Becoming Serial Acquirers

AI-powered time tracking for freelancers and agencies

Vote to Promote Sergey Miryanov

I'm Broke and Mostly Friendless, and I've Wasted My Whole Life (2018)

The S&P 500 Hits a New Record High, Powered by Tech–and Not Much Else

The reason Anthropic must IPO now [video]

AlphaSteel Review 2026: Ingredients, Benefits and Complete Guide

Chrome's Response to Recent CcTLD Registry Hijacks