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?

Teleflow: A local-first teleprompter and selfie recorder for creators

Show HN: LifePath – See what Einstein was doing at your exact age

Forget "Fat" Models. The Future Is Narrow

Show HN: InLie – See manipulation tactics in political videos, live

I Built a WordPress Plugin Nobody Asked For. Here's Why –. and How

Stop Getting 'Good' at ChatGPT (2024)

Atomic Physics in Pure Anglo-Saxon

Show HN: Zero Trust Boundary for Agents

Senator Lindsey Graham, Republican of South Carolina, Dies at 71

Moving Averages (2022)

Lame 4.0 Released

Intro to Multiplicative Calculus [video]

'I'm not a programmer' anymore: Linus Torvalds on the only two tools he uses now

Unify AI Horn alternative using ESP32, WizNet 5500, Poe and a Ti Amp

Show HN: Inkfold – workspace across multiple AI providers with shared memory

Why Mechanical Sympathy? (2011)

Word Count Benchmarks for Websites and Email

List of theaters and campaigns of World War II

China unveils high-power microwave weapon arsenal with up to 100 gigawatts

ESDM Is Now Open Source

T. rex fossil could become most expensive dinosaur ever sold

24-zig

Show HN: PalExplorer – peer-to-peer file sharing with no central server

The Caste of Intelligence and the Big Tech Blueprint

Agent Service – promptable AI agents with guardrails and downloadable packages

Using Kamal 2.0 in Production

AI Should Build Its Own Research World Model

Cruxcoach – Manage many climbing boards privatly in one app

What I learned publishing a paper

Best Hiking Boots (2026): Walking Shoes, Trails, Backpacking