Packed Data Support in Haskell

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

77•matt_d•10mo ago

Comments

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

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

Zolomon•10mo ago

They mention this in the article.

spockz•10mo 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•10mo ago

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

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

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

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

100% private Mac dictation app

Designing Defensive Databases for Agents

LightningPDF – HTML to PDF API with a native renderer and Chromium fallback

Apache Fory C++: 10x faster serialization than protobuf

Solow's 1987 Computer Paradox Explains Today's AI Measurement Crisis

Snap-confine and systemd-tmpfiles = root (CVE-2026-3888)

Show HN: The Lottery of Life

Undone Computer Science

I Don't Know ML. Claude Does. 0.871 F1 on Predicting Linux Game Compatibility

Title: "Announcing S3syncy – Open-Source Real-Time S3 Synchronization"

Using Ledger, plain text accounting and a touch AI to fill in my UK tax return

Agents over Bubbles

Agent Package Manager

Show HN: N0x – LLM inference, agents, RAG, Python exec in browser, no back end

Switzerland Built an Alternative to BGP

The Healing Power of Social Friction

Cognitive overload: When processing information becomes a problem (2022)

Z AI Character Card Wiki

Why investors won't know what to make of AI for a while

OTel-Native by Design – Back Ends That Export to Any Observability Stack

Superpowers

Show HN: Paste your YAML to calculate and optimize GitHub Actions costs

No space, no power, no support – what life is like for Indian IT workers

Spite Driven Development

Show HN: Libfyaml 1.0.0-alpha1, a modern YAML library for C

Ask HN: I built a geometric reasoning engine – what should I test it on?

SSH has no Host header

Real or Slop? – Programming Languages Papers Edition

Commandments of AI (Mindfulness)

Knowledge workers managing AI show collapsed productivity, not just a plateau