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?

Show HN: AgentBox – SDK to Run Claude Code, Codex, or OpenCode in Any Sandbox

Sort by Controversial (2018)

AI and Teaching – The Brave New World

Amal Khalil and the Lie We Keep Repeating

Show HN: AI Square Face Avatar Generator and Classic Flash Pixel Icon Generator

Apps and programming: two accidental tyrannies

Big O for MySQL: Why the Same Query Gets Slow at Scale

Dear Codebase: A Letter from Your Coding Agent

White House accuses China of 'industrial scale' theft of AI technology

Muon Experiment Eliminates Fifth Force, Confirms Standard Model

Name in Landsat

Audio transcription is worse in 2026 than it was in 2016

Making beautiful work is getting harder

AuraCode – An AI Agent tool to visualize and chat with messy codebases

Dioxus – Fullstack app framework for web, desktop, and mobile in Rust

Show HN: JSBT – binary serialization for real JavaScript object graphs

Bitwarden Statement on Checkmarx Supply Chain Incident

Show HN: Uvx skill-mgr install -t Claude -t codex

macOS Desktop app v0.0.1 Preview Release "bot with a budget" idea

IP Networking in Deep Space

To Protect and Swerve: NYPD Cop Has 547 Speeding Tickets

Building with teams in two continents is hard. Here's what I learnt

Researchers Simulated a Delusional User to Test Chatbot Safety

Decoupled DiLoCo: Resilient, Distributed AI Training at Scale

Show HN: LocalLLM – Recipes for Running the Local LLM (Need Contributors)

A Comprehensive Guide to Model Routing for Coding Agents

Show HN: When Your Repo Moves, Your AI Coding History Doesn't

Aster Mail – End-to-end encrypted email with post-quantum cryptography

Oldest known recording of a whale song could unlock mysteries of the ocean

Inflated AI claims are under fire–and the regulatory reckoning is coming