Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•9mo ago

Comments

nine_k•9mo 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•9mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•9mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•9mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•9mo 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•9mo 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•9mo 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•9mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

A cosmic collection of old Soviet space imagery

Video is a Drawing App (2025) [video]

Lines of Code Are Back (and It's Worse Than Before)

Hunter-gatherers took refuge in European 'water world' for millennia

Why Does Dial Up Sounds Like That? [video]

Recent Tropical Cyclone Outer Size Increases in the Western North Atlantic

Robots with human-inspired eyes have better vision

Humans are not the only animals that treat each other's injuries

Ruby on Rails doesn't use CSRF tokens anymore

SpaceX takes down Dragon crew arm, giving Starship a leg up in Florida

Mewgenics Wiki, Breeding Guide and Class Database

US businesses and consumers pay 90% of tariff costs, New York Fed says

Elon Musk posted about race almost every day in January

U.S. Health Officials Defend Rejection of Moderna's Flu Vaccine

Uber's Rate Limiting System

Continuous Tensors

Republicans vote to end Trump's Canada tariffs

What the FDA's 2026 Update Means for Wearables

Show HN: Production-Ready Django and React Auth Starter

Russia bans WhatsApp, pushes state-backed alternative "MAX"

Show HN: Quoracle, a recursive consensus-based multi-agent orchestrator (Elixir)

Making the Vortex Mixer

Show HN: Drift – Real-time codebase health dashboard with AI-powered fixing (Go)

I built a zero-noise AI code review agent using Claude Code

If SEO is rocket science, AI SEO is astrophysics

What Is Claude? Anthropic Doesn’t Know, Either

Texas Lawmakers Sound Alarm on 'Torture, Killing, and Inhumane Treatment'

Finding the Active Voice

Show HN: The Algorithm's Favorite Child – A social experiment

OpenClaw Partners with VirusTotal for Skill Security