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?

SpaceX no longer needs NASA, and that's a problem for America's space agency

Highway thieves are spoofing GPS to steal millions in data center-bound cargo

The Economic Organisation of a POW Camp [pdf]

Why big tech stopped building useful stuff

The Hottest New Side Hustle Is Stripping Copper Wire and Posting About It

Building fine-grained version control for agents with Rust and Durable Objects

Martian meteorite found in the Sahara is 4.1B years old

Local Decisions in DuckDB

The Battle of the Green Dot

DualChem Benchmark

Thoughts while watching myself be automated (2024)

A (lukewarm) defense of Minsky and Papert

LLMs bring new nature of abstraction (2025)

LeadPilot

Dartmouth provost resigns following accusations he used AI for writing

Achim Leistner

DIY AI Lockpicking Robot: ESP32 and Claude AI Opens Any Lock [video]

Diana Pfeil on Evals [video]

Open-weight AI models can exploit the patch gap

The Physics of Getting Fired

'I fear for my family': Berlin mayoral candidate's messages expose Hamas ties

A Pig, the State, and War: Porco Rosso (Kurenai No Buta) (2014)

Buildings full of machines are tied to modest local job growth

Much Ado About None: Sentinel Values in Python

Show HN: Charter, field-level control over agents' calls into customer accounts

Google value plunges by $500B as AI fears rattle Wall Street

Intel stock plunges after posting disappointing Q4 outlook

Chinese Universities in Jiangsu Begin Paying Staff in Digital Yuan

Biltong.ai

The Great American Rascal: Tom Sawyer at 150