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?

Show HN: Pure – An interactive satire on the absurdity of 'Terms of Service'

Show HN: RocketGift: Find the perfect gift in 30 seconds using AI

Flow Control: a programmer's text editor

Fixed Points and Strike Mandates (2012)

Indiana had most losses in college football. Now it's a championship contender

The Binding Problem

Running Claude Code in a loop to mirror human development practices

What happened in Moq library: A Blog on Controversies (2003)

Why Programming Was Never About Code (Opinion)

Meta II: a syntax-oriented compiler writing language. (1964)

Show HN: Stateless compliance engine for banking and blockchain

Years and Years (TV Series)

Fefe is back

UX for reversible actions: A decision framework for designing for recovery

Bitwarden Lite

Running With Scissors cancels game over AI-generated assets, days after reveal

In conditions of scarcity, elephants (like humans) don't play nice

Robust code generation combining grammars and LLMs

Show HN: UISora – AI-Powered Mobile App UI Designer

Chernobyl radiation shield has stopped working after Russian drone strikes

Are We Testing AI's Intelligence the Wrong Way?

Sardine-inspired washing machine filter removes 99% of microplastics

A Reminder on the Realities of Digital Purchases

Olympian Motors

Olga Tokarczuk Recommends Visionary Science Fiction

Why Does A.I. Write Like That?

National Security Strategy of the United States of America [pdf]

I made this because I was struggling as a dad can you tell me what you think?

Why Boulder PD transitioned to encrypted radios

Grokipedia's political perspective closely matches Elon Musk's personal views