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?

CERN Joins the OpenSearch Software Foundation as an Associate Member

Show HN: Robust alternative to OpenClaw

More Communities Like This?

Show HN: Job Scraper for LinkedIn

Show HN: Agent Armor, a Rust runtime that enforces policies on AI agent actions

Coming Soon: Things That Matter in AI

AI Tremor-Print: Biometric Identification System

Allbirds stock sees a wild surge of 582% on pivot from sneakers to AI

RIP Pull Requests (2005-2026)

JIT Compilers and Cache Coherency

AI Eyebrow Filter: Try Eyebrow Editor Online – AILab Tools

EU age verification app ready as Europe moves to curb kids' social media access

A Black-Box Contract Engine for Agentic Software Development

Lovable vs. Bolt vs. Replit: who's leaking the most Supabase data?

Leonardo, Borgia, and Machiavelli: A Fateful Collusion

Eustella: We reinvent ChatGPT for Europeans, with OpenClaw in mind

The Elegant Laminar Flow of Moroccan Tea [video]

From Idea to Deployed App: Full Laravel Workflow with LaraCopilot

I made an MVP in one day

AI Data Residency: When Cloud APIs Don't Meet Your Compliance Requirements

The New Window

The Mathematics of Tetris (2011)

What Is WebAssembly? (2015)

I Let Claude Opus Write a Chrome Exploit

Building agent skills: Intent, determinism, and stability

The OSRS Botting Problem Is Architectural

Modern Games Look on CRT Monitors

Gemini 3.1 Flash TTS

Alpine.js X-Data: A Surprisingly Capable State Manager

Security.ubuntu.com Is Down