Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Reddit vs. SerpApi et al.

The Age-Old Urge to Destroy Technology

Richard Feldman: language runtime overhead (2022) [video]

Show HN: I built an open protocol for Agent-to-agent commercial negotiation

Rare China visit, Taiwan's opposition leader calls for reconciliation

Did WordPress VIP leak my phone number?

OpenAI Codex reaches 3M weekly active users, up from 2M in under a month

What Is a 'Cyberdeck': Meet Gen Z's New DIY Obsession

Roc: Fast

What does Lockdown Mode do to keep you safe from spyware? [video]

An AI Agent. In COBOL. Yes

Ask HN: Is there some sort of stigma around Qubes OS on HN?

Effects of Stablecoin Yield Prohibition on Bank Lending

The Signature Method in Machine Learning (an interactive reading note)

The Martians

We Got the Lithium-ion Battery (2024)

Completely Private AI

FormTo – Open-source, self-hosted form back end

Show HN: I built a Zoom alternative with 1 command

Starving Genies

Roc

Struggle Against the Gods

Google adopts new stance on device fingerprinting (2025)

All of the String Types

Škoda DuoBell – The Bike Bell Designed to Penetrate Noise-Cancelling Headphones [video]

Russia Hacked Routers to Steal Microsoft Office Tokens

The Building Block Economy

HappyHorse 1.0 – Turn Any Idea into AI Videos Instantly

C's Biggest Mistake

What "Open" Means: Abliterating Gemma 4 in 24 Minutes