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?

Show HN: Self hosted excalidraw workspace with storage

Help, my dentist started coding – or: a little history of low code solutions

The Seinfeld Chronicles

A return to two-pizza culture

Study: Universities must rethink how they prepare students for an AI world

Reliable OST to PST Conversion

Boston Is Drinking Like It's 1776. The Founding Fathers Would Be Proud

DOGE self-deletes on July 4th. The grand experiment fell apart long before that

The Founder Who Got Fired for Ignoring His Own Return-to-Office Rules

JavaScript still can't ship a full-stack module

ClickHouse is winning the Observability Wars

In-browser programmable robot simulator

Nocode: Way to write secure and reliable applications

Carbon Engine – open-source tech powering EVE Online

Show HN: A Simple Containerized Browser

Category Theory Illustrated – Monoids

Thieves Are Now Targeting AI Data Center Construction Sites for Copper

Bhopal's '90-degree' bridge turns out to bend 118 degrees (2025)

Ask HN: How are you creating demo videos for your product?

Instagram running ads promoting child sexual abuse material in India, BBC finds

A big Markdown file should become a PDF you can navigate

Very Average Prototypes

Scaling Java-Based Real-Time Systems: Hidden Tradeoffs of Event-Driven Design

The virtual power plant era has arrived

Intent-addressable code for AI coding agents

Show HN: Autosynth – generating synthetic data with strong/weak model filtering

The Intimate Legacies of a White-Supremacist Coup

Guandimiao (Archaeological Site in Henan, China)

Astrophysicists Puzzle over Webb's New Universe

Diseconomies of scale in fraud, spam, support, and moderation