Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•10mo ago

Comments

nine_k•10mo 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•10mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•10mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•10mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•10mo 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•10mo 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•10mo 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•10mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Unpacking the deceptively simple science of tokenomics

The Tocharian *klewos: nom-klyu

LeadsFromURL – AI finds buyer-intent conversations on Reddit from your URL

lsgit: List Git Repositories

What it's like being an airline pilot when missiles start crossing flight path

Show HN: Zmod codemod toolkit, 8x faster

Linux 7.0 File-System Benchmarks

IMs Come, IMs Go

Show HN: iQWEB – a diagnostic engine for website performance issues

I built 225 programmatic SEO pages – Google indexed 18%

AI Copyright Truth

Show HN: I couldn't scale my YouTube channels, so I built Shortgram

Attention Should Cost a Penny

CloakShare – Open-source DocSend alternative with video streaming (MIT)

Ask HN: Which third-party Mac apps feel indistinguishable from Apple apps?

AI Liability Insurance Arrives

US economy sheds 92,000 jobs in February in sharp slide

Get your Eurosky account now

Beyond Dunbar: Civilization Was Right to Move Beyond the Village

Show HN: Simple Stripe analytics dashboard – MRR, churn, LTV on one page

Serverless for Your Servers

VW Dealers Revolt over Plan to Sell a New Brand of SUV Directly to Consumers

Ask HN: Anthropic account suspended, anyone reinstated?

Running the Andquot;Reflections on Trusting Trust&Quot; Compiler

The Golden Age of Those Who Can Pull It Off

Show HN: Awesome Voice Typing

Apple's latest product is a game-changer

GPS jamming is emerging as an increasingly prevalent, troubling, weapon of war

Anthropic, Cypherpunks, and the Bomb: 3 Rounds of Technologists vs. the State

$1k and the difficult future that AI has left for many