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?

USAID Cuts Killed People. That's the Truth

Zig: All Package Management Functionality Moved from Compiler to Build System

A Verdict on (The) Slaughter

Show HN: Plot Workshop – A story planning tool for writers

Glaze made me an editor for this site

Anthropic's Co-Founder and Top Economist on Doing Research at the AI Frontier [video]

The Sportsbook Is Recruiting the Next Founder Before Startups Do

Analog Computing: The Infinity Between 0 and 1 [video]

The Vertical Codebase

Axiom: A social platform where all ideas are logically valid

Confidential computing's core trust mechanism is broken. The fix may not exist

$33B sitting dead on-chain

"if you don't pass an allocator you can't allocate"

Scaling Laws, Honestly

The night the Earth shook, strangers started to draw

Toxoplasma Gondii

Anthropic Issued with a Cease and Desist

The End of North America

Curveball

Happy Independence Day

Papa Johns Can Predict When Your Fridge Is Empty

Show HN: Follow London Trains in 3D

Combined 1D and 2D Barcodes

Alexa+, the Next Generation of Alexa

Are we still writing software?

ActiveGraph v1.2.0 is live – x30 speedup

The LLVM Compiler Infrastructure

Understanding the Dynamics of the AI Ecosystem with Pace Layers

For Tailscale, good feedback is private feedback

Show HN: See a Random American