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?

Yann LeCun on What Comes After LLMs [video]

Speculative Decoding, Visualized

Optimal Elevator Placement

The "memory shortage" that no one saw coming

OPM finalizes rules expanding its power over RIFs, employee appeals

Rare footage of humpback whale birth captured on drone video

Send a file from this browser as a stream of QR codes

His Wedding Guests Were Arriving–Just as His $45B Fund Was Falling Apart

Salmon Hat

AI Visibility Evidence Model: Five Factors, Graded by Evidence

The year Claude users sued over limits is the year the limits mostly went up

Requirements for Interference-Tolerant Radio Altimeter Systems

Explorative Modeling – A new axis for pre-training

Looking inside a 1970s PROM chip that stores data in microscopic fuses (2019)

Uranium in cobalt-hydroxide exports from the Democratic Republic of the Congo

Freeze the model, train the harness: gains transfer across LLMs and benchmarks

File transfer using animated QR codes

Proactive V Reactive; from a Startup Founder's Perspective

LLM speculative decoding explained simply

Benchmark: 68x faster than AWS DMS for real-time CDC

NoMachine ditches free edition and forums

How to measure the performance of a quantum computer

Show HN: SmokeVPN – All-in-One WireGuard VPN Hub – Switch Exits in Realtime

Why Journalism Matters to Democracy (2025)

Texas bans THC cannabinoids except delta-9, except edibles and drinks

A Safe Path to Open Weights

Readable ad-hoc commands agent skill

How to Exist

US Treasury undertakes historic intervention in yen market

Random Thoughts of Lineage and Death