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?

Byte, Vol. 7, No. 8 (1982) [pdf]

Net 11 introduces runtime-native async replacing compiler-gen. state machines

Looking Back at Lewis and Clark

LocalEmu, a free AWS emulator (fork of archived LocalStack)

A disappearing Service Processor (2025)

Frona v2026.5.5 – self-hosted personal AI assistant

The price of the Manhattan Project (2013)

Transfer Emotions to VR Avatar via Brain with PiEEG XR

The Cost of AI

Who Has the Hardest Fist in China's AI Valuation Race?

Saffron

An OS in pure Rust with its own TCP/IP and TLS 1.3 stack, fetching the live web

Why Anthropic Just Became the Most Valuable AI Company on Earth

API Drift Detection: Catch Breaking Changes Before They Reach Production

NeXTWORLD Interviewed Steve Jobs (1992)

Nexa-gauge – LLM evaluation framework with per-node scoring controls

Old Blue Workbench

Could nature itself hold the solution to climate change?

Parallel Reconstruction of Lawful TLS Wiretapping

Jef Raskin, the Visionary Behind the Mac

Harness Engineering Course

They Might Be Giants – I'm Impressed (2007) [video]

Marketing skill for Claude with 26 evals – +20pp over baseline

Show HN: Nimic – write pure Python and compile AOT to native binaries via Nim

Software stocks wrap up best month since 2001; talk of 'SaaSpocalypse' subsides

Oscar-winning Star Wars editor Marcia Lucas dies aged 80

Show HN: AI Simulaionen Based on FEP

Diablo 2 map generator based on 31 bits of information

Autism subtypes identified using cross-species functional connectivity analyses

Killing PRs was the easy part, now technical death keeps the CTO up