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?

Weird A.I

A Critique of Cybernetics, by Hans Jonas (1953) [pdf]

Axavive vs. Collagen: Which Is Best for Skin in 2026?

Hella Jongerius: I am a design pastor (holistic d-ethics)

Why AI Projects Fail

Digger engines drive JCB's attempt on hydrogen-powered land speed record

"I applied to be pope"

Hella Jongerius Retools UN Delegates' Lounge Preserves Dutchness (NY 2013)

AI Will Hit a Wall in 2026, if nothing changes [video]

The Ozempic plateau may be caused by the drug starving the gut bacteria

EU iPhones Get AirPods-Style Pairing for Third-Party Wearables in iOS 26.5

How to Build Better Startup Products Using Apple's Thinking

Trump Says Nvidia CEO Jensen Huang Is Flying with Him to China

Chrome IndexedDB: SQLite back end

The role of cat eye narrowing movements in cat–human communication (2020)

One Startup Is Gambling. Ten Is Mathematics

Emergent Quantization from a Dynamic Vacuum

What Is BusyBox?

Social Media Is Now Parasocial Media

Too many people have peed in the pool (2016)

Redis and the Cost of Ambition

Notes on the Physics of Startups by Rob Snyder [video]

Free AI hiring toolkit for startup founders

Math reveals the one game of chance you should always accept

The Stream Virtual Machine [pdf]

Largest survey of physicists puts Standard Model of cosmology under scrutiny

Utah's 'hyperscale' data center could create heat island near Great Salt Lake

WireGuard: Fast, modern, secure VPN tunnel

Lumo Chat Export

England Runestones