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?

Beware power stations where the app won't work without an Internet connection

Show HN: A unified API for electronic component pricing (Mouser, DigiKey, TME)

An Analogy Between LLM Agents and the Human Brain

One Human and One Agent = One Browser from Scratch

AI2: Open Coding Agents

A tiny proof for a tiny LLM

mini-presenter

Cocaine study that got up the nose of the US (2009)

SoundCloud Data Breach Now on HaveIBeenPwned

A Regenerative Accelerationist Manifesto

Show HN: YAFS – Yet Another File Server

The history of C# and TypeScript with Anders Hejlsberg | GitHub

EU and India Reach Free-Trade Deal as World Responds to Trump Tariffs

Ur-Fascism: Umberto Eco

Scheme Benchmarks

Assessing internal quality while coding with an agent

Nudify apps found on Google and Apple's app stores

Show HN: Dexicon – Capture AI coding sessions so your team never loses context

Is this the Year of Linux paid Apps?

French lawmakers approve bill banning social media for children under 15

Management as AI superpower: Thriving in a world of agentic AI

AI isn't inevitable. We should stop it while we can

CNCF: Kubernetes is 'foundational' infrastructure for AI

Bad Claude's Constitution

Should professors be forced to retire?

Software Should Work Conference

Wanderly: One App to Plan, Budget, and Book Your Next Adventure

Show HN: Pingram – Send Telegram alerts with 1 line of Python (20KB)

Run your startup from your phone

Checkout Supacode.io