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?

Map of every park in Salt Lake City

The Fall of the Theorem Economy

Do City Delivery Drones Make Sense? No One Knows, but They're Flying over NYC

B-tree based collection types for Go

Chrome's AI features may be hogging 4GB of your computer storage

Its the Age of Electricity and America Isn't Ready

TikZlings – A collection of cute little animals and similar creatures

Why payment escrow for AI agents needed a different design

A super simple tool tells you who called the function and who implemented it

Proposed Amendment to the Telephone Consumer Protection Act of 1991

OSS Review Toolkit

'WEALTH CONFISCATION': Blue states roll out taxes targeting homeowners [video]

A man who blew up a nuclear power station and disappeared

Shunting-Yard Animation

They dug up Troy and lost the gold

Rust-based ScanCode-compatible scanner for licenses and copyrights

Using AI to onboard to a new codebase

Cyclekart: How to build a soapbox with a motor [video]

Technical Dimensions of Live Feedback in Programming Systems

The Reality of an Employer's Market

Disgraced US gov software contractor found guilty of database destruction

Akamai surges on big LLM deal as Cloudflare dims

WFY24 – A performance-first weather widget with 2km hyper-local AI forecasting

'Dirty Frag' Linux flaw one-ups CopyFail with no patches and public root exploit

The Blue Collar Delusion: Why the machines don't have to climb up to us

Paper Factory

Louis Rossmann tells 3D printer maker Bambu Lab to 'Go (Bleep) yourself'

AI Is Making Digital Fraud Easier, Faster and Harder to Stop

I made rust's cargo copy but for CPP

Owl Alpha – A free model for agentic workloads (prompts logged / closed-source)