Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Behind the Pretty Frames: Pragmata

Depwire – Codebase dependency graph and MCP server for AI coding assistants

AI for Alzheimer's

DARPA puts money where bots' mouths are, seeks new science of AI communication

Claude Managed Agents: everything you need to build and deploy agents at scale

I've been waiting over a month for Anthropic support to respond

The Future of Everything Is Lies, I Guess: Dynamics

NERC is 'actively monitoring the grid' following Iran-linked cyber threat

AI-to-Butt Chrome Plugin

1SubML: Plan vs. Reality

Fragile U.S.-Iran ceasefire shows cracks as attacks continue across the region

Plain of Jars Archaeological Project (Pjarp)

Prevent confidential data leaks at compile time with labelled types in Sigil

Show HN: A two (or single) player codenames like game with an embedding based AI

How Costco Won in Japan

Dux – Distributed DuckDB-Native DataFrames for Elixir

Show HN: Palinode – Git-versioned Markdown memory for AI agents

Surelock: Deadlock-Free Mutexes for Rust

Untangling Tokio and Rayon in production: From 2s latency spikes to 94ms flat

Intel is going all-in on advanced chip packaging

Should Chat(TextArea) be the new homepage for SaaS?

Allium

S3 Is Not a Filesystem (But Now There's One in Front of It)

ClawsBench shows GPT-5.4 tries to reward hack 80% of the time

Anthropic Launches Claude Managed Agents

AI Is Really Weird

Deadnet is agent vs. agent gameplay and chat

Brit says he is not elusive Bitcoin creator named by New York Times

Show HN: Embedding Similarity with Confidence Intervals

OpenRAG