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?

Americans Mess Up Their Taxes. A New Law Will Help

Visualizing Google Page Rank [video]

German teachers: Pupils do not know how to listen, hold pens, or use bathroom

Apple Chip Chief Johny Srouji Could Be Next to Go as Exodus Continues

The War over Wine

Indie Outdoors

Improving my productivity and context switching with Git worktree

Rnj-1: Building Instruments of Intelligence

Ask HN: AI tools to enhance old SATB choir recordings?

Asymmetrical Wing Configuration for Reduced Drag in Transonic Flight

Vulnerabilities in Spain's mandatory vehicle emergency beacon

TigerBeetle as a File Storage

Brain Efficiency: More Than You Wanted to Know (2022)

Within the Context of No Context, Revisited

Hating Stranger Things During the Death Rattle of Criticism

Spotify Wrapped but for LeetCode

Should CSS be a constraint system instead?

Show HN: Zafiro – a painterly 3D island in the browser (Three.js)

AI Continuity System: Safe Multi-Instance Collaboration without Persistent Mem.

React2Shell Exploitation: A Short Summary of Honeypot Activity

Every Commodore 64 Ultimate comes with a USB Cassette, pre-loaded with goodies

My experience learning AI from scratch and why it changed how I see coding

Ask HN: Is a human brain more like a CPU or an FPGA?

X shuts down the European Commission's ad account the day after major fine

I created A-Lang – a new lightweight language, focused on simplicity and speed

Optimizing Associative Operations (2015)

For a Literary Saint, Margaret Atwood Can Sure Hold a Grudge

Navigating the future of AI agent security with Dan Moore [audio]

Using AI to Modernize Ubuntu Error Tracker Produced Code That Was 'Plain Wrong'

Sitekick – simple AI-driven web chat and lead-capture for any website