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?

A Controlled Study of Attention-Only Transformers

The first six ideas in machine learning

Never Enough

Show HN: My Attempt of Ricing macOS

Air Force conducts live-fire test for Collaborative Combat Aircraft program

Nanbeige4.2-3B

What's under your feet in New York City

Ask HN: Why AI labs publish different benchmarks?

Salience Induction Against Multi-Hop RAG Agents: Threat and Defense

Running Laguna S 2.1 locally on Apple Silicon: 52 tok/s with 38.5 GB peak memory

Making Our Own Spectrogram

Choosing GPT-5.6 Sol, Terra, or Luna in Codex

Martin Picard's Mitochondrial Theory of Mind

R2 is now Generally Available (2022)

Starveling Rabblement

Show HN: Remote Bash Script Debugger

A mechanical light bulb from 1675 [video]

Volkswagen blocks Android devices running GrapheneOS from myVW App

The AI Bubble Is No Ordinary Bubble

Yubikey 5.8

Déjà View: Someone already tried this

Late.sh – a command-line Clubhouse for computer people

Dashrath Manjhi – Mountain Man

America's AI labs are under threat from cheap Chinese rivals

The conservative road to nowhere: Hanson's empty populism

Faze Marketing – Free Platform for Developers to Connect with UGC Creators

Luau Type Functions

Hydrogen Production utilizing nuclear process heat

Oracle's credit rating drops to one level above junk [video]

Lifesaving Genetics Tool Works Best If You're White