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?

EMDR Bilateral Stimulation – Adjusted to You

Ask HN: When AI models use harnesses who liable between model/harness/user?

Agent Applications: A Reference Architecture for AI Agent Systems

Evals Are the Next Bottleneck

RNA droplets may have helped start life on Earth

Loose Navigation Grids

LG Display Develops New OLED Panels with More Brightness and Longer Lifespans

Clicks Communicator: First Look [video]

What breaks when you switch LLMs?

Show HN: The First 3D Map of North America's Underground Geology

Bulgaria's Nuclear Plant Plans First Output Cut Due to Low Danube

DuckDB v2.0: Your Database Deserves a Better Parser

Going Freestanding

Top Open Source MCP Gateways in 2026

AI for science needs reasoning, not just data – Eric Schmidt and Suhas Mahesh

Why can't you combine .tar.gz files with cat?

Same Tencent VPS plan in 8 regions: identical CPU different networks

Under Trump, Protected Wild Horses Are Going to Slaughter

I'm done coding with AI [video]

Show HN: Pacer – Realtime Claude Code Usage Tracking / Pacing

Everyone Says Assembly Is Untyped–Everyone Is Wrong

On Mount Etna, Lightning Has Claimed More Lives Than Eruptions Since 1980

Show HN: RecoveryCodes – MFA inventory for auth outside IdPs

We Ship Our Security Webhook Fail-Open

Music Theory for Programmers

Firefox Extensions Linked to Crypto Wallet and Credential Theft

Google Cloud us-west1 down

Google Maps adds agentic features, including food ordering and hotel bookings

No, Anthropic Won't Be the Only Company Left

Cognition and consciousness arise from analog computations, says new theory