Packed Data Support in Haskell

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

77•matt_d•12mo ago

Comments

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

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

Zolomon•12mo ago

They mention this in the article.

spockz•12mo ago

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

cstrahan•12mo ago

No, one example of why being variable sized integers.

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

carterschonwald•12mo ago

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

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

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

lordleft•12mo ago

This was very well written. Excellent article!

NetOpWibby•12mo ago

Is this like MessagePack for Haskell?

Thalidomide Scandal

Superpower Suicide Or, Attempted Suicide

AI cannot plan

Europe to burned American scientists: We'll take you in

Show HN: OO – Automated O&O Shut-Up for Windows

Show HN: DDoS detection in 0.9s, tested against a 48 Gbps attack live

Fast Fourier Transforms: for fun and profit (1966)

Ask HN: Oh, What Places to Go (Seriously Tho)

Show HN: MTTCleaner – Same as CCleaner but free, no ads

Why Has There Been So Little Progress on Alzheimer's Disease?

Multiple things can be true at the same time

U.S. Considering Foreign Designs, Shipyards for New Navy Ships in $1.85B Study

Google Spanner On-Prem (Spanner Omni)

Show HN: SigmaLifting CLI – helping agents understand strength training

Foundational aspects of spinor structures and exotic spinors(2025)

What Managerial Economics can tell us about AI and Software Development

Kraken Scales Serverless to Balance the National Grid (InfoQ) [video]

Agents Aren't Coworkers, Embed Them in Your Software

Aprendendo Inglês Com IA

Bees Change Color with the Weather

How Copenhagen built a metro for free (The Flying Moose) [video]

Show HN: I built a PyPI watchdog that tests whether packages work

IronBCI-32: 32-Channel 24-Bit EEG for BCI Research

Microfiche, Microfilm and Other Minutiae (1981) [video]

The most successful health campaign in modern history

DeepSeek-V4 on Day 0: From Fast Inference to Verified RL with SGLang and Miles

Understanding the short circuit in solid-state batteries

Uranus's Outermost Rings Are Made of Two Different Things

Boulder's water supply hangs on for now amid historic drought conditions

Once a Year, Seattle Center Becomes a Medical Clinic