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?

Google auto-banned my Bug Hunter account for exposing their fake "Delete" button

iPhone 18 Pro Camera Review: Dunton, Colorado

Low-Cost Servers for AI and Developers

Show HN: A directory of 164 Asian AI companies, ranked by disclosed scale

ComplianceSnap – Free Ada/WCAG risk scanner for Shopify/WooCommerce stores: C

Antigravity-Preview-09-2026

Garbage trucks analyze homes with AI-powered cameras

Pentagon weighs pulling nearly a third of U.S. forces from Europe

The open source version of Claude Project that gives you the context ownershp

Essays of Dario Amodei are why people are worried about artificial intelligence

Jev plays Roulette Wars on its own

LeanReact: Expressing Composable and Correct React Components in Lean

Shapelearn Qwen 3.8 27B (13.1 GB VRAM)

Minimal Phone 2

Ubuntu 26.10 Moves cp, mv and rm Over To Rust Coreutils For 100% Transition

AWS now supports spend limits

You can run Git on object storage if you re-make packfiles

.agt – The Agent Namespace

Tiny e-readers aren't small Kindles. They're a different bet

Unix Was Right. We Made Linux Too Complicated [video]

This California Educational Juggernaut Doesn't Need the SAT

Spectral AI Architecture: Executive Summary and Core Concepts

What Is LPO, NPO, CPO? Knowledge of Optical Interconnect Technologies

Ask A Monk – A digital wilderness for thoughts with no immediate answer

Kubernetes v1.37: Hardening emptyDir and bind mounts

Fender Is Making Enemies with a Messy Fight over Its Iconic Strat

Show HN: PortButler – send files from macOS to a device with no way to receive

How often people say a habit, therapy, diet or supplement changed their life

Fingerprinting Network Honeypots with Weighted Behavioral Scoring Engine

Claude Code from Source