Packed Data Support in Haskell

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

77•matt_d•10mo ago

Comments

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

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

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

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

cstrahan•10mo ago

No, one example of why being variable sized integers.

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

carterschonwald•10mo ago

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

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

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

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Claude is down 8:29 pm PST (3/2/26)

Iran executes Khamenei's plan to spread regional war

Show HN: AsmForge: Open-Source AI-Powered Assembly IDE Based on Eclipse Theia

A "Game First" Implementation of GenAI (Unity and Agents)

Show HN: Time to Decimal Calculator

Intent-Based Commits

Apply Within – Bringing applicative desugaring to Scala for-notation

U.S. Marines Fire on Protesters in Karachi

Using a GPT-5-driven autonomous lab to optimize cell-free protein synthesis

Augustus: Open-Source LLM Prompt Injection Tool

Eoghan McCabe: "There is one way that SaaS can be saved"

Show HN: Starcraft2 replay rendering engine and AI coach

Groveling for Dollars (1998)

Building My Own Canva over a Weekend

The Interface Theory of Perception [pdf]

The Support Agent Who Never Burns Out

Beijing Doesn't Think Like Washington–and the Iran Conflict Shows Why

Show HN: Personal AI gateway for OpenClaw – tokenomics

Dabao evaluation board for Baochip-1X

U.S. Troops Were Told Iran War Is for "Armageddon,"

A brief history of logic [pdf]

Working on multiple tasks in parallel using 1 OpenClaw Agent

He wanted to use ChatGPT to create sustainable housing. It took over his life

Whats Up with Claude Lately?

Deploy OpenClaw Agents in 6 seconds

Giving LLMs a personality is just good engineering

Elevated Errors in Claude.ai

ChatGPT uninstalls surged by 295% after DoD deal

Lessons from HFTs: Flip Coins

The daily hub for AI coding tool updates