Packed Data Support in Haskell

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

77•matt_d•12mo ago

Comments

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

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

Zolomon•12mo ago

They mention this in the article.

spockz•12mo ago

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

cstrahan•12mo ago

No, one example of why being variable sized integers.

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

carterschonwald•12mo ago

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

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

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

lordleft•12mo ago

This was very well written. Excellent article!

NetOpWibby•12mo ago

Is this like MessagePack for Haskell?

Ask HN: How to think in terms of parallel Claude agents

Why Maine's Governor Just Killed a Pioneering Data Center Moratorium

Sense, local code intelligence for AI coding agents

I found an old telephone and made it control Spotify

FSF Position on "Ethical" AI

The AI Compute Crunch Is Here (and It's Affecting the Economy)

Scientists are worried about Atlantic Meridional Overturning Circulation slowing

"Wealth inflation" has led to "elite overproduction"

Claude OAuth

Ada Palmer's "Inventing the Renaissance"

Chatnik: LLM Host in the Shell

Tabularis: A lightweight, cross-platform database client for developers

The implementation of Carrier Pigeon Internet Protocol RFC1149 25 years later

A Brain Dump of What I Worked on for Uncharted 4 (2016)

I built a deterministic 10k-node VRP solver on a $100 phone

Hokusai and Tesselations

Clean energy pushes fossil-fuel power into reverse for 'first time ever'

Simulacrum of Knowledge Work

Biometric Identification in a Vehicle Environment

GPT-5.5 is a biased evaluator: authorship and order effects

The Quiltmaker's Gift (2000)

Show HN: Readox, playlist-style read aloud extension for articles, PDFs and docs

Adding Compilation Metadata to Binaries to Make Disassembly Decidable

How to Attend the Altman vs. Musk Trial

WebTUI: Modular CSS Library that brings the beauty of Terminal UI to the browser

Show HN: HyperFrames – OSS Agentic HTML Video Framework for Agents

Framework Laptop 13 Pro: Major Upgrades and Linux Front and Center

How Elon Musk Used SpaceX to Benefit Himself and His Businesses

Starting Sandboxes in Parallel

M5Stack CardputerZero Powered by Raspberry Pi CM0 Launching on Kickstarter Soon