Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•10mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Show HN: Neural DNA – 258 params that grow network topology

Searching for Fast Astronomical Transients in Archival Photographic Plates

Microsoft's Rust Training

2k Words Becomes One Word – a short story co-created with Claude Opus

Talent Atrium – evaluation-first hiring (rank candidates before CV review)

Show HN: Hooky – A lightweight HTTP webhook server written in Go

What Is Entropy, Really?

Vim-classic: Long-term maintenance of Vim 8.x

RXB- SHA-256 PoW blockchain use onion-only network built-in CPU mining

RuntimeGuard v2 – enforcement and easy security posture config for AI agents

Ever Wondered What Life Looks Like in Reverse?

From error-handling to structured concurrency

The CPU Was Left for Dead by AI. Now AI Is Bringing It Back

Autism-Therapy Firm That Was Paid $340k per Patient Is Barred from Medicaid

NeurIPS Statement on Sanctions

Developing Creative Identity

Chonkify – compression for RAG and Agents that outperforms LLMLingua by ~4 times

Do Back-to-Back Courtroom Losses Herald Meta's 'Big Tobacco' Moment?

DoltLite: Free, open source drop-in replacement for SQLite with version control

The Harmony of Theory and Practice in the Design of Tall Buildings(2015) [video]

You probably don't want to buy a retro console

Python 3.3: The Version That Rewired Everything

A prolonged Middle East conflict could reshape how we fly

Modly: Drop a photo, get a 3D mesh, open source and runs on your GPU

Skeleton of Three Musketeers hero d'Artagnan may have been found

Roots of Copernican Revolutions [video]

Inside the far-right network targeting Europe's digital rules

Agent Identity System

Basecamp Goes Agent-First

The U.S. Said It Helped Bomb a Drug Camp. It Was a Dairy Farm