Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

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

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

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

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

cstrahan•9mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

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

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

Europa members and EPI accelerate the rollout of sovereign pan-European payments

Advertising Reloaded: How AI Is Transforming Advertising

Creatine Use and Thromboembolism Risk in Athletes

Building a billing system is still hard, even with AI

Show HN: CI That's a Cinch

Show HN: Nova Stack – Verifiable TEE Apps on AWS Nitro with ZKP Attestation

Today Is Groundhog Day

Show HN: Vibe Hardware Engineering as a Complete Novice

Analysis of Congressional Stock Trading Patterns

Free 50+ AEO signals AI visibility audit with Bilarna

Why So Much of Silicon Valley Is Mum About Minneapolis

YOE and this is my vibe coding exp as well

Msgvault: Private Gmail archive and search system

Great Kantō Earthquake

MoltMatch the First AI Agent Dating Platform

I built a low-cost CAN-bus sensor for air quality/light monitoring using ESP32

Elon Musk's SpaceX to Combine with XAI Ahead of Mega IPO

George A. Philbrick

The surprising attention on sprites, exe.dev, and shellbox

Ask HN: How do you give AI agents access without over-permissioning?

Show HN: A Fast CLI for global fuzzy-search on Claude Code sessions

News publishers limit Internet Archive access due to AI scraping concerns

Annote: Writing Java using only annotations

Measuring the quantum extent of a single molecule confined to a nanodroplet

Windows chief shared MS emails with Epstein regarding the Surface RT disaster

An Ode to Independence (2010)

Let the Barbarians In: How AI Can Accelerate Systems Performance Research

Show HN: PoopyFeed – Self-hosted baby tracking for feedings, diapers, and naps

Semantic Operators: Run LLM Queries Directly in SQL

What did the groundhog see? Punxsutawney Phil's winter prediction is in