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: Prisoners, German tank and 61 more puzzles, with simulations

Show HN: Weeny.Cloud – A Linux server for your coding agent's apps

Frontier quality at 1% of the cost: a production benchmark of LLM classifiers

Ask HN: Is anyone running multi/always-on agents that don't cost a fortune?

TripleF

I Built Fluxer

Pro-Palestine protestors enter Microsoft datacenter site

Tesla wants its sworn Cybercab answers to NHTSA kept secret

Declarative Dragging

Show HN: Lost and Fought – a 90s Style RTS – browser with multiplayer

Why tradwives are fleeing the movement: I can't undo my past

Algorithm Visualizer

DeepSeek Super Agent Just Killed All Agent Harnesses [video]

Lowvram: A CLI tool to run large AI models in low VRAM GPUs

A once-controversial idea is advancing understanding of Parkinson's disease

Tesla Winding Down Production of Cybertruck, Musk Says

GSoC 2026 Showcase

Getting traffic from aocr.org? It's ByteDance

Vals AI found a critical safety and alignment issue in recent models

Salon, Pioneer of Digital Journalism Founded in 1995, Shuts Down

From the Vault to Your Library

Why Bloat Is Still Software's Biggest Vulnerability

A Fake Job Interview Led to the $6.34B Binance Hack

A Mathematician Is Chasing Eclipses with Algorithms and Cameras

A medieval map mystery may be solved

Apple's predictive text restrictions include 'Dictator Trump' and 'Sleepy Joe'

Activists break through fences at Microsoft's data center site in Amsterdam

Tesla winds down Cybertruck production after years of poor sales in few markets

Enough Phone: A new small phone

Ask HN: How's your home-cooked software revolution going?