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?

Solar Open 2: Korea's Sovereign Foundation Model, Built for Agentic Use

Why care about programming languages

Her rape kit had a DNA match. In San Francisco, that's not enough

Agent Host Protocol

Data Science Weekly – Issue 661

Dinitz-Garg-Goemans conjecture is false

Why AI Challenges Us: Ego, Awareness, and the Illusion of Ascent

Doesn't OpenAI have every incentive to destroy HuggingFace?

Computational Arbitrage in AI Model Markets via Routing, Finetuning

AMD calls CUDA a 'non-event'

First experimental evidence of recursive self-improvement (RSI)

What we know about the typical Polymarket user

Show HN: AI-factory – a spec-driven pipeline that stops AI agents rotting code

Deleting Systems You Don't Understand

AMD EPYC 9006 Venice Announced and Looks Poised to Be a Grand Slam

Looking for Feedback on Website

How Tether Benefited as Trump Insiders Shaped First Crypto Law

The Gospel of Gains: How Fitness Culture Went Mainstream

Microsoft deleted Nokia's archive of unreleased ringtones in 2016 HMD sale

Kalytera – tells you why your AI agent failed, not just that it did

Locked in An Escape Room with Jacob Tsimerman

DOE Fires the $5B Starter Gun for Its AI-Targeted Genesis Mission

The AI Productivity Paradox

Show HN: How far do I have to go to run into 100k people?

Sometimes Being First Means Seeing the End Before Anyone Else

AI Agents Don't Respect Font Licenses

Show HN: Advanced Coffee Search Covering Over 17,000 coffees

Show HN: Connecting my dumb garage and car's homelink buttons to Home Assistant

US announces double-digit tariffs on most of globe to replace expiring duties

Tesla shares tumble 11% after discounts hit profits