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•11mo 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?

The Fast and the Furious – Interactive Storyline and Filming Locations

V8 Exploitation: From Libc Pwn to Browser Bugs

Ipxlat: a stateless IPv4/IPv6 translation device

How have we changed since our species first appeared?

Vladimir Putin Singing Blueberry Hill

Under the hood of MDN's new front end

YouTube Premium price is going up $2 to $15.99/mo

State Dept. Directive Signals Shift from Counter-Disinfo to Cognitive Warfare

Chrome Extension: Aftermark, your bookmarks are breadcrumbs

A Tinyblog about Tinygrad

PyUnixOS – A Unix-Like OS in MicroPython for ESP32

Show HN: MLForge – A visual graph editor for building PyTorch models

Amazon Luna ends support for third-party subscriptions and game purchases

Voting Through the Veil: John Rawls on selfish vs. selfless voting

The Million-Dollar Nose

Valve Developer Improves the Linux Gaming Experience for Limited VRAM Hardware

Pizza Legacy an Open-Source Reimplementation of Pizza Connection (Pizza Tycoon)

Physicists resolve a long-standing puzzle over the size of a proton

The Future of Everything Is Lies, I Guess: Annoyances

Brazil seizes over 1,100 weapons and 1.5 tons of drugs from US, says official

Black traffic: the corporate sabotage technique you've never heard of

Nexus AI

BYD to open 20 car dealerships in Canada this year

Selective Test Execution at Stripe: Fast CI for a 50M-Line Ruby Monorepo

QB64 Tutorial A beginner's introduction to game programming

Show HN: Peer – health research chat, 6 medical databases, verified citations

Published on Rapid API

Canada Can't Pretend America Is Still the Good Guy

The Case That More Openness Brings More Good to Society

Measure coding productivity with this Claude Code Plugin