Packed Data Support in Haskell

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

77•matt_d•7mo ago

Comments

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

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

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

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

cstrahan•7mo ago

No, one example of why being variable sized integers.

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

carterschonwald•7mo ago

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

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

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

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Too Early, Too Alone: France Prepares for Russia as US Withdraws

The Doomers Feel Undeterred

In which our protagonist dreams of laurels (and how we lost with FOSS)

Thirteen years of Rust and the birth of Rue

Go Gray, Not Cray: Why You Should Grayscale Your Phone

I 3D Printed Origami [video]

How to Ship Confidently When Your Back End Makes Things Up

Show HN: Latameo – exploring what it's like to live in Latin American cities

Michaelmas

Weight loss jabs: What happens when you stop taking them

Can I offer "login with yahoo" using FusionAuth?

An open-source screening platform accelerates discovery of drug combinations

Lemon-Shaped World Is the Most Stretched-Out Planet Ever Seen

Celebrating 10 Years of DirectX 12

Concluding thoughts on our deep dive into Windows clipboard text conversion

The Windows clipboard automatic text conversion algorithm is path-dependent

What went wrong when I matchmade my friends

Rules for Reading the Epstein Files

500 Hours of vibe coding: LLMs fight my coding standards at every turn

Show HN: Build apps with 500 models locally. No tracking, no cloud, just code

Fallacies advocating software bloat

What even are Cloudflare Durable Objects?

Show HN: Twitch Plays Claude – Crowd-controlled live coding experiment

Show HN: 12k+ Nano Banana Pro Prompts Organized in One Place

Utah homeless campus takes shape

Show HN: An authority gateway that controls AI actions before they execute

Foundation Models for Scientific Discovery and Innovation

Show HN: Building a 2D Platformer Video Game on an Oscilloscope

Show HN: Tooly – Developer tools without the ad clutter

Live cameras are tracking faces in New Orleans. Who should control them?