Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•7mo ago

Comments

nine_k•7mo 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•7mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•7mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•7mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•7mo 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•7mo 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•7mo 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•7mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Microservices Should Form a Polytree

Married millennials, here comes the crypto divorce cliff

IBM nears $11B confluent deal

Chinese phonemakers seize on Apple's AI struggles

Show HN: Opinionated Cloudflare D1 and Kysely toolkit

Samsung's recent AI ad spam crushes creativity, and the irony is stunning

Rope Trick Effect

Artificial intelligence research has a slop problem

Going direct: notes on Eli Lilly at a trillion

Justin Bieber dislikes Apple's dictate button placement

Show HN: Leetwrap – A "Spotify Wrapped" for LeetCode

Show HN: Preflight – Replace shell validation scripts in Dockerfiles

Speech and Language Processing (3rd ed. draft)

Show HN: Crier – Push notifications via TCP or MQTT (no public IP needed)

Proposed Link Between Quantum-Corrected Geodesics and Dark-Matter-Like Phenomena

The Path to Mojo 1.0

A Clever Approach to AI Drawing I Accidentally Discovered – Bear. Best

BusyBox-Only Linux

Versioning Events Without Breaking Everything

IBM nears $11B deal to acquire Confluent

Show HN: CatalystAlert – Free biotech catalyst calendar (985 companies tracked)

Show HN: Brick Starter – .NET SaaS starter kit to ship production apps faster

Russian authorities have imposed restrictions on FaceTime

Kinesis Advantage2

Show HN: Peargent – A Simple Python Framework for Building AI Agents

Indian boy, aged 3, becomes youngest rated chess player in history

Finnix

Fifty Years of Retracted Medical Publications from 1975 to 2024

Apple Taps Meta Lawyer as General Counsel in Latest Shake-Up

Estimate Trend at a Point in a Noisy Time Series