Packed Data Support in Haskell

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

77•matt_d•1y ago

Comments

nine_k•1y 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•1y ago

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

Zolomon•1y ago

They mention this in the article.

spockz•1y ago

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

cstrahan•1y ago

No, one example of why being variable sized integers.

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

carterschonwald•1y ago

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

tlb•1y 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•1y 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•1y 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•1y ago

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

lordleft•1y ago

This was very well written. Excellent article!

NetOpWibby•1y ago

Is this like MessagePack for Haskell?

AI, your way: introducing the Poolside Platform

10 years helping Rails devs reach App Store. Today, someone shipped without me

Richard Dawkins concludes AI is conscious, even if it doesn't know it

Oil 101, Second Edition

An Open Letter to Jay Bhattacharya

Show HN: I built a spoiler-free WWE dashboard for 2001-2019 with 15,000 matches

PostHog Code

Nostr Mail – Nostr Mail Documentation

Spaces Protocol May 2026 Update

Orbee chat: your name, your people, your rules

Changes in Hospital Finance, Operations and Quality After Management Consultants

DigitalOcean's NYC region looked fine – until we ran it again

Understand EOB and medical bill text locally in Chrome

OpenAI smartphone leak reveals next-gen chipset and more details

Detecting silent LLM agent degradation before users do

UALink AI Accelerator Spec Maintains Rapid Update Pace

The exotic particles that could break the Standard Model

Quantum Key Distribution (QKD) and Quantum Cryptography (QC)

Teeny-Tiny Notes

National space weather center on chopping block

David Attenborough, 'the voice for nature,' turns 100

Dreamer: Make any coding agent self-evolving, across the whole team

The Other Twin Towers in the Spider-Man Trailer

CBOMkit: Explore the Use of Cryptography in Software

Tokens and Dreams

Curious cases of financial engineering in biotech

Cross-target schema drift in Cal.com: 1 finding in 1096 fields

Congress Is Doing Little to Prepare for Potential A.I. Job Losses

Eight vaccines linked to a lower risk of dementia

IBM didn't want Microsoft to use the Tab key to move between dialog fields