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?

White House plan to break up iconic U.S. climate lab moves forward

A calmer interface for a product in motion

Show HN: On-Call Health – spot burnout before it hits your engineers

Astro – Ochestrator of AI Agents Such as Claude Code and Codex

Authentication with Pocket ID

Trump's DOJ is not falling for Sam Bankman-Fried's MAGA makeover on X

The Bhangmeter, a 1960s device to measure nuclear detonations

Show HN: CastReader – Free TTS Extension That Reads Kindle Cloud Reader

Auto-georeferenced 381 Soviet military maps of China

When the Simulation Starts to Feel Real

QuickBEAM: JavaScript Runtime for the BEAM VM

Show HN: The Bones of PearlOS

Reddit's database has two tables (2012)

Dario 12 months ago: In 12 months, nearly all code may be generated by AI

Do current trends in drone technology favor offense or defense?

#238 – Sam Winter-Levy and Nikita Lalwani on how AI won't end nuclear deterrence

MongoDB outage – AWS UAE and Bahrain datacenters

Show HN: Scan your dev machine for AI agents, MCP servers, and IDE extensions

Show HN: Mozzie – a local desktop orchestrator for AI coding agents

API Design Principles for the Agentic Era

Lloyds, Bank of Scot and Halifax apps showed customers other users' transactions

Launch HN: IonRouter (YC W26) – High-throughput, low-cost inference

AI Cluster Runtime: Reproducible Configs for GPU-Accelerated Kubernetes Clusters

NM framework on Karpathy's autoresearch factory

Oops, You Wrote a Database

Engram – A distributed memory system for AI agents, with extensible architecture

Show HN: Mingle – find and connect with people, like LinkedIn but in your chat

Current and former Block workers say AI can't do their jobs

PHP-rnet – a PHP extension that mimics real browser TLS fingerprints

A small CLI for stopping Git worktrees from fighting over ports