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?

Discovering and exploiting vulnerabilities in critical software with Claude

A QE Q&A [pdf]

A Second Look at Apple's Secure Kernel

Spatial Reality Display ELF-MN1 Developer Site

Mathematics of the Future [pdf]

Weibel Labs

Each filter was right; together they let through two sentences a day

zzz.com – Jason's Page

Soda Honey Boost ReviEwS (2026): We Tried It My Honest Review

Eyespots in Automeris Moths Mimic Sympatric Owl Species

VisualMaths

Retrace: Find the Origin of Any Image

Research paper: early ratings create herding bias in product review systems

Exiled Brazilian political opponent's desperate run for the US through Argentina

Mrzkh

Show HN: CI-Lifeboat – Offload GitHub Action runners to your desktop

RAG retrieval accuracy depends on chunking. I measured how much

Operative report for the first liver transplant (1963)

From May-October this year, I recovered 490 pieces of the famous Doves Type

Worm is Getting a 2027 Comic Adaptation with IDW Publishing

Melting glaciers in Dolomites reveal cache of first world war munitions

Satellites show some of the strongest evidence the AMOC is weakening

Why My Dad Didn't Have a Cell Phone

Building an AI Predictive Stock Algorithm

Sony ELF-MN1 Spatial Reality Display

AetherGrid, an open-source distributed AI workload orchestrator

Static Site Generators for Beginners

Solving Postgres' Count Problem

New Products (2014)

Artificial Analysis Intelligence Index v5.0