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?

Music in Even Parts

80% Prompt Injection Success Rate Against Claude Auto Mode

Metric Spaces – An Interactive Exploration

The fixer at the center of FIFA's meltdown

Google further buries search results under AI mode

Thousands of Interstellar Objects May Be Lurking in Our Solar System

Firefox Addon – "summary" link for Hacker News posts

Show HN: Too many articles to read, let random algorithm decide what I read next

Iceland votes on whether to restart talks on joining European Union

QDay Algebra 2M prime factor in nanoseconds

Tiny World Model

Let the Clicks Speak: A Simple Score for Popularity-Driven Ranking

Quis Custodiet Ipsos Custodes?

News-deframe: Structural comparison of how news outlets frame the same event

Magic eye tube (The first RF "debugger")

Understanding Event-Driven Systems

Google translate is a better writer than me

I Found Two Shopify Plugin Zero-Days in a Bathtub

OpenLake: Fast, Durable Storage for LLM Inference and Training

Who Is Antigone? The 2500-Year-Old Rebel with a Cause

SwarmWorld: Stigmergic technological evolution in societies of LLM agents

Why Everybody Hates Palantir

Xiaomi Magnetic Bluetooth Speaker: iPhone MagSafe Stand and Speaker in One Tiny

ELPI – Embeddable Lambda Prolog Interpreter

Experience Machine

RFC draft-meow-mrrp-00

BoqCalc, an AI pipeline that prices a 500-line BOQ without hallucinating rates

Blue-Collar Jobs Are the New Flashpoint in Data-Center Fight

AI Lattice Proofs with Chris Peikert

When do Markov chains converge?