Packed Data Support in Haskell

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

77•matt_d•1y ago

Comments

nine_k•1y 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•1y ago

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

Zolomon•1y ago

They mention this in the article.

spockz•1y ago

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

cstrahan•1y ago

No, one example of why being variable sized integers.

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

carterschonwald•1y ago

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

tlb•1y 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•1y 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•1y 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•1y ago

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

lordleft•1y ago

This was very well written. Excellent article!

NetOpWibby•1y ago

Is this like MessagePack for Haskell?

Lucy – pay-per-task AI agent in USDC, no subscription (A2A/MCP/x402)

A revolution in mathematics? What happened a century ago and why it matte [pdf]

The Internet can't stop watching Figure AI's humanoid robots handling packages

AI dev tools: Cost, ROI, and budgeting for 2026

24/7 Renewables Are Ending Fossil Fuel Reliability

Only 17% of all 64-bit Integers are products of two 32-bit integers

Show HN: Stainless replacement – paste OpenAPI, get TS/Python/Go SDK ZIP in 1.5s

Opaque Types in Python

A local-first multimodal knowledge platform for managing entities

I keep bouncing off the Scheme language

Funding Rate Arbitrage on Crypto Perpetuals: Implementation and Backtest

Why Svelte Is Better Than React in the Agentic Era

Fixing WebRTC data-channels head-of-line blocking with RFC-8260

LeoMoon Wiki-Go is a modern, feature-rich, databaseless flat-file wiki platform

Spotify and UMG announce licensing deal to allow AI covers

Show HN: I created a disk usage explorer CLI

CodeAlta – a terminal workspace for agentic coding

How Unfair Is the Coin?

OpenXiv – Open-source preprint server on AT Protocol that federates to Bluesky

We should get rid of average CPU utilization

What's New in Flutter 3.44

Trump's Endgame Is Surrender

SEO Survival Kit – Claude Code Plugin for Core Update Recovery

RuView – WiFi DensePose: See Through Walls with WiFi (Scam Alert)

Open Accountants

A nightmare experience: Trying to open a bank account with Bank of America

Trump pulls back AI order over fears it could slow US technology

Bytewax: Stream processing library built using Python and Rust

Odroid H-series is going 10 GbE (ODROID-H5)

Deepfakes Tore a High School Apart