Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

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

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

2026 Pennsylvania Health Insurance Outlook

Why Can't New York Get Rid of 2-Person Subway Crews?

WhatsApp Took over the Global Conversation

Sen. Bernie Sanders slams Mehmet Oz for praising robot ultrasounds in Alabama

Nano Banana Pro-Studio-Quality AI Image GeneratorNano Banana Pro

Alternatives to MinIO for single-node local S3

One can mock the righteous, but Google won't index it

Corporate Governance Authoritarianism

ComfyUI – Overview

The Malloc Maleficarum (2005)

The thing that brought me joy

From culinary dud to stud: how Dutch plant breeders built a brussels sprouts boo

U.S. Habits That Shock the Rest of the World

How Computers Work

The crisis whisperer: how Adam Tooze makes sense of our bewildering age

Facing the Paradox of Software Visualization

Darwin Core

Musk seeks up to $134B from OpenAI and Microsoft in 'wrongful gains'

Show HN: Xarticles – Browse X articles by category

FreeBSD 15.1 Aims to Have KDE Desktop Installer Option

Raising money fucked me up

AWS databases now live on Vercel Marketplace and v0

Show HN: Interactive timeline of US Military bases and interventions, 1900–today

QucsStudio: A free and powerful circuit simulator

I Used Claude to Build a Transcription Bot That Learns from Its Mistakes

Reverse Engineering a Biometric Attendance Machine

ICML Experimental Program Using Google's Paper Assistant Tool (PAT)

Show HN: Upseated – Swap airplane seats with other passengers

Automation Isn't Innovation

Writes vs. Talks About Software