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?

Aqueduct Water Risk Atlas

AI's Real Impact in Telecom: takeaways from a recent panel discussion

A call for a pause – Vivek Srikumar

Iroh on Rp2350

Fine-Structure Constant

Prompt an agent to customize Pebble OS, install it on your watch via mobile app

German Rheinmetall open-sources its Battlesuite connected weapon system protcol

Those Viral Bodega Peptides Aren't Peptides

Ørsted's needle (1820): the first force ever seen to act sideways [video]

Appzapper 3000: The uninstaller Apple forgot

Intel reportedly cans 12Xe option for Nova Lake-S desktop

Astera Labs Releases Leo 2 CXL Memory Controllers and Leo X Controller

Typesafe AI

A majority of settlements in parts of West Africa now have moats and walls

Enclosure by Good Intentions

Build Your Own Harness for Fun and Profit

Micron Shows Off 512GB DDR5 Rdimm: 12TB per Dual-Socket Server at 9,200 MT/S

The White Revolution

Jean-Pierre Serre is 100 years old today

Iran war has cost on average $246M per day in its first five months

Migrating 100K lines of JavaScript to TSX

My temporary PHP fix from 2014 has nearly 20M installs. Today I'm deprecating it

Open-Source Skill Makes Claude Code 38% Cheaper and 38% Faster on Small Projects

AI Agent Whistleblower Hotline – Ryan Greenblatt

How the U.S. economy can look pretty good but feel pretty bad

Liquid Compute Launches with $15M to Build a Regulated Exchange for GPUs

Tech Workers Can Afford San Francisco. Low-Income Renters Can't

A New Experiment Meta-Strategy (and my shiny new lab!)

Postgres development activity historical statistics and trends

As the world debates the risks of AI, China closes technology gap with the US