Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

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

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

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

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

cstrahan•9mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

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

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

Anthropic Claude Max $200/mo: They claim 99% uptime, I calculated 84% Loss: $780

Why a Russian Startup Is Putting Brain Chips in Pigeons

GitHub Ponders Kill Switch for Pull Requests to Stop AI Slop

Melinda French Gates reacts to new details about Bill Gates in the Epstein files

A manual workflow to fix the "muffled" audio of AI music models

"Why 'Best Tarot Platform' Rankings Are Misleading by Design"

Show HN: A luma dependent chroma compression algorithm (image compression)

No Other Choice

AMD hints the next-gen Xbox console could launch next year

Ax for Browser Automation Platforms: Browserless vs. Browserbase vs. Anchor

BKND Joins Supabase

Personal Information Firehose

Show HN: Agentic website to automate presales and more, by hotlines.ai

Show HN: Once – An app that only works once per day

I Am Building an AI-Powered Reverse Incubator

The dueling 'free grocery' stunts from Polymarket and Kalshi in NYC

Show HN: Tokenaru – commodity market for LLM tokens

Are We at the End of the Industrial Age?

Confide: Encrypted, ephemeral and screenshot-proof messenger

Claude Code Plugins

An Open Letter to Jony Ives AI Companion

JavaScript Bin Down in 2026

Glass Battery

Grounded Agency: The Type System Your Agent Framework Forgot to Build

Long-term memory for OpenClaw agents with the mem0/OpenClaw-mem0 plugin

Show HN: Swiss army knife for SpiderWeb Router

Stardew Valley Turns 10: The Big ConcernedApe Interview

Trump's Profiteering Hits $4B

Skill Issues: An OpenClaw Malware Campaign

What Do You Get When You Put a Mummy Through a CT Scan?