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?

Show HN: Praxos – Multiplayer AI

European Commission Reaches Agreement

Jev is an honest game changer

Ask HN: Dead Internet

Floci: Local AWS Emulator for Development, Testing, and CI

The Real-Time Volumetric Cloudscapes of Horizon – Zero Dawn

Why So Much Money on "AI"?

What Palantir Actually Does

A tiny macOS menu bar app that keeps your Mac awake with the lid closed

Strands harness: frontier performance with 28% lower token cost

Accumulated Variance

Lasso: AI Watermarks Change How Agents Act

Show HN: WebGCM – a global climate model running in the browser on WebGPU

Lisse: Squircle JavaScript Library

Splitt – Group expense splitting, settle-up, no caps (iOS)

Synthesia Interactive Avatar API

The Internet (1997 – 2021)

Show HN: A Self-hosted Deferred Deep linking. Firebase dynamic link model

Gold Steadies as Traders Weigh Inflation and Fed Hike Outlook

Teen Autopsy Marks Arrival of Deadly Drug Cychlorphine in San Francisco

A Kansas girl ran off to join the circus and changed the tattoo world

'Epigenetic' editing banishes hepatitis B virus

Fly.io 2026 Pricing Update

macOS 26.4 silently enabled login keychain data protection

Google CC, an AI agent built for families

Ask HN: Why does it matter if no one reads your novel as long as the AIs do?

IA Agent Arthur – Developed an OfflineAIagent

Building Software That Can Prove Agents Wrong

vLLM Architecture, Memory and Benchmarks Deep Dive

CBP suspends all personal prescription importation Oct 22