Packed Data Support in Haskell

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

77•matt_d•7mo ago

Comments

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

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

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

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

cstrahan•7mo ago

No, one example of why being variable sized integers.

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

carterschonwald•7mo ago

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

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

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

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

DynamoDB: Resilience and lessons from the Oct 2025 service disruption [video]

Sentimental Versioning

When you don't create things (2020)

Show HN: Argly – Turn your iPhone into a remote for your Mac [over WiFi]

Show HN: I want to democratise Bloomberg Terminal

Profitability Matters More Than You Think

Excuse Me but Eating "Ten Million Dogs and Cats" Why

Congress screwed up on the GENIUS act: stablecoin holders have fifth priority

AI toys for kids talk about sex and issue CCP talking points, tests show

Being a SysAdmin Is Hard

PAG: A Formal Grammar for Structuring LLM Prompts

Welcome to the golden age of employee monitoring

A new C99 optimizing compiler, with full testsuite

Show HN: A tiny Rust CLI tool to clean and fix messy CSV files

Project Athena Strategic Plan (Jared Isaacman, NASA Head Nominee)

A Case for Owning Your Data

Innocent Man Gets Arrested at Peppermill Casino After AI Says He's Someone Else [video]

How Well Do LLMs Understand Tunisian Arabic?

LMArena Is a Cancer on AI

Exploring the chip on a contactless payment card

iOS TCC Lets Hacker Feed Reach Undocumented Liverpool Service

Linux 6.18 Changelog

The Mastermind Box Cover

Everything you need to know about GPT-5.2

Ask HN: What was the most humble living situation you had in your early days?

Letting the Minecart Crash

Post-Quantum Cryptography (PQC) Support in Nginx

Show HN: Create AI Videos and Images

PSRT v2.0 – A Generative Theory of Intelligence and Meaning

The Jim Sharman Diaries: Behind the Scenes on the Rocky Horror Show, 1970s