Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

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

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

Show HN: End-to-End Static Type Checking: PostgreSQL to TypeScript

How we stopped worrying and bought an Electron Microscope [video]

Worktrunk: Git worktree management for parallel AI agent workflows

UN: Pact for the Future

Sunset $600 MRR app from App Store

Show HN: I built an AI tool that generates YouTube thumbnails in seconds

The Pheix project published postmortem review following the latest release

BMW Recalls 36,922 X3s over Steering Software Glitch

Claude wrote a functional NES emulator using my engine's API

Tiny fee on Minneapolis carbon pollution won't do much for the climate

Generative Intuition

Tell HN: Happy New Year

Migadu Email: The Missing Email Service for Domains

A Beginner's Two-Component Crystal-Style Wi-Fi Detector

Exploiting Silent Delivery Receipts to Monitor Users on Instant Messengers

Claude Code Anywhere

Show HN: TimeProofs – Prove when data existed without uploading it

Two Decades of Piracy Reporting: TorrentFreak's Retrospective

Immutable Infrastructure, Immutable Code

'Ghost resorts': 100s of ski slopes lie abandoned–will nature reclaim Alps?

Stages of AI Grief

The science of how (and when) we decide to speak out–or self-censor

The Best Cable in the World (For Developers)

Best Free Online Escape Room Games in 2026

Immigrant Derangement Syndrome

Nvidia GB10's Memory Subsystem, from the CPU Side

Nvidia Groq Update: Everyone Gets Rich, Patent Warfare Begins

Show HN: LoureiroGate – Differentiable Physics Guardrails for PyTorch

The Cost of Translation

Vect AI – The Autonomous Marketing OS for 10x Growth