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?

San Francisco supervisors balk at 362-page, AI-assisted city code rewrite

Show HN: Agentic OS – the operating system for AI agents

My Mac's Wi-Fi Was Crawling at 50 Mbps with a Perfect Signal

An opinionated (and mainly correct) guide to naming

Serving Local AI on My Jetson Through Durable Streams

US lifts curbs on Anthropic's Fable, Mythos AI models

Anthropic launches Claude Science: an AI workbench for scientists (2026)

Discretizing Reward Models

Exploring The Spectrum -Dr. John Ott documentary on the health effects of light [video]

Guardians of the Agents Formal verification of AI workflows. (Dec 2025)

Oʻahu Needs More Solar, Not New Power Plants

WhiteHouse lifts export control on Anthropic that froze its most advanced models

The Future of Software Engineering Is Here but Not Evenly Distributed (Updated)

Taiwan raids Super Micro in widening China chip smuggling probe

White House picks Avi Loeb with polarizing alien theories to lead UFO council

The President Made More Than $1Billon in Crypto Deals

A Fusion First: Realta Demos Direct Energy Conversion

Show HN: Explore Ethereum by the Shape of a Transaction

Faster Gemma 4 on MLX with multi-token prediction

Why Jet Engines Aren't "Made in China"

Scott Alexander as a modern-day Edmund Wilson

Frame Error

Wikipedia: Deleted Articles with Freaky Titles

Tor’s Arti 2.5.0 Released: Stable Counter Galois Onion

Llmaker – spin up a working LLM app from a single prompt, right in your terminal

The Threat of Residential Proxies

JWST spots mature galaxy cluster, redefining "cosmic noon."

China's Great Green Wall: 66B trees growing faster than natural forests

The Green Metrics Tool

A new AIs-heading technique to track grain smuggling