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?

Create flashcards with Space CLI

UK firm aims to build 'data centre' using 50k lampposts in Nigeria

Show HN: Chuchu, an Android SSH client built on libghostty

Jankó Keyboard

Manufacturing qubits that can move

Our side project: cyber-research-AI IDE, writing an exploit for CVE-2026-23918 [video]

Britain Learned and Unlearned Nuclear

J2G – Convert Jenkinsfiles to GitLab CI (.gitlab-ci.yml), offline

Nature's hardware store: building the future with biology [video]

Novo Navis Intelligence Sobers Up the AI Community

Show HN: AaaS – Agent as a Service

Cambridge University Raises Money to Help the Homeless in Cambridge

The FCC Wants Your ID Before You Get a Phone Number

Wanted: A new tech-industry writer for The Economist

Refineshot: Rethink Cinematography with Foundational Skill Evaluation

GrapheneOS fixes Android VPN leak Google refused to patch

AWS to also block ipcomp and xfrm modules in DirtyFrag mitigation

Rtwatch: Watch videos with friends using WebRTC

Canvas Data Breach; DeepSeek V4 Flash Boosts LLM Inference 4.3x

I am the best lightsaber fighter in Europe

Self-Fulfilling Misalignment Data Might Be Poisoning Our AI Models (2025)

It Was a Good Quarter for "Other Income" [A16Z Charts on AI Growth]

Callbacks in C++ using template functors (Rich Hickey, 1996)

Show HN: Mochi.js: bun-native high-fidelity browser automation library

Frontier Airlines plane hits person on runway during takeoff at Denver airport

Running Codex Safely at OpenAI

Marrying for power: Gendered alliances in mafias

Meta can read your Instagram DMs starting Friday

GameStop CEO Trying to Buy eBay Says He Was Banned from eBay

What the Naysayers of Vibe Coding Are Getting Wrong