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?

The Man Who Stayed [video]

See how your investments would look if they never lost value

A Curriculum for Tools for Thought [pdf]

It is incorrect to "normalize" // in HTTP URL paths

I Made a Free Stick Figure Generator

DateBoy (2024)

"Liberation Day" at OpenAI as multiple senior executives announce leaving

Ask HN: How are short-form video algorithms impacting your deep work?

Show HN: A site for stopping work slop

The Core-Math Project

A Message to All Humanity: Three Onboard UFO Encounters [video]

Discovering Dennis Ritchie's Lost Dissertation

Show HN: InGaming, front end MVP for casino brands

Handling Instruction Branching in Modern Processors

Hanlon's Razor

Meta targets May 20 for first wave of layoffs; additional cuts later in 2026

Show HN: Podads – An Ad Blocker for Your Podcasts

Mastering Page-Level Chinese Calligraphy via Layout-Guided Spatial Planning

Lambda Calculus in K

The Social Battery Across Scales: Household, Labor, and Global Systems

Why does sharing a private Gitea repo still need adding a collaborator in 2026?

Total Solar Eclipse Led to Seismic Quiet for Cities Within Its Path

Show HN: Twitter Media Downloader – X Media Downloader

Tinder and Zoom offer 'proof of humanity' eye-scans to combat AI

Show HN: My workflow for using Plan 9 on Windows

The most beautiful formula not enough people understand [video]

What the EU Battery Passport Means for Your Devices

Study: The Logic Behind AI's Judgments of People

Were early humans limited by materials–or by ideas?

Is It O.K. To Be a Luddite? – By Thomas Pynchon (1984)