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?

Daintreehq/daintree: A delegation environment for orchestrating AI coding agents

Setting Up Server Monitoring for a Rails App on Hatchbox

GameStop makes $55.5B takeover offer for eBay

Banks seek to offload risk to avoid 'choking' on data centre debt

The Clippy Paradox: How Note-Taking Became Its Own Irritation

Evals Skills for AI Agents

Are AI agents a scam? [video]

I developed an alternative to Jira with Claude in 8 days, all by myself.

Tractors, beige boxes and what's next

MiniMovie: An Anti-IMDB

Friendlier LLMs tell users what they want to hear – even when it is wrong

Chinese hospitals are selling de-identified patient data to fuel the AI boom

How does your team handle cloud cost review – dedicated process or ad hoc?

Control AI Risk with Pre-Built Frameworks and Ready-to-Run Evaluations

Screw You, Realtek

China's Rare Defiance of US Sanctions Sparks Showdown over Banks

Richard Feynman on Teaching (1986)

When did stories become so centred on good battling evil? And why? [video]

I have had this M5 Mac <48 hours and this happened when I moved the hinge

I'm a contractor – I built a $9.99/mo Bluebeam alternative for Mac

Personal AI Health and Therapy Companion

A Russian Family Was Isolated for 40 Years, Unaware of WWII (2013)

What went into the machine and what came out: single-line fonts and engraving

Over 8M Thermos jars and bottles recalled after 3 people lost vision

The piracy paradox at Udemy (2015)

Amazon EC2 Beta (2006)

The End of Violence

Blink – AI powered Search. A knowledge destination

Google Says Prompt Injection Moving from Theory into Real Abuse

How Does SaintQuant's AI Bot Enable 24/7 Crypto Trading?