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?

Ask HN: Identity preservation vs. information transfer in LLMs

After falling far behind the rest, Blue Origin creates new stock option plan

Show HN: Query Hacker News with SQL: Public HN API as In-Memory DuckDB Tables

Show HN: AI agent that runs real browser workflows

Laser-Based 3D Printing Could Build Future Bases on the Moon

Do Offshore Wind Farms Pose National Security Risks?

PgAdmin 4 9.13 with AI Assistant Panel

There are 56 ethnicities in China–and 55 are getting squashed

The Road

Fifty years of sexing up tech: Apple's epic hits – and misses

Chinese tech hubs promote OpenClaw AI agent despite security warnings

The Architecture of an Exit Scam: A Technical Audit of Zszrun

China's AI giants are handing out cash to lure in users

Do the Illegible

Amdahl's Law

Ask HN: P2P Trust Network for reviews in the 2020s

Why "Authentic" Is the Next Thing We'll Game

Claude Code Skills and Plugins as an Open Source Project

Curious about just how adult the weather can get

LLM-Assisted Reverse Engineering

6k Bad Coding Lessons Turned a Chatbot Evil

F-35 Software Could Be Jailbreaked Like an iPhone: Dutch Defense Secretary

Depression is getting ahead of me

Show HN: SiClaw – an open-source agent for debugging infrastructure incidents

The Canonical Document

Kovan: From Production MVCC Systems to Wait-Free Memory Reclamation

MacBook Air M5 review: Almost perfect

Is Srqcgx Safe? A Technical Audit of the "Wrapper" Fraud Architecture

Just keep doing the bit (Karma Yoga Edition)

Show HN: Sandboxing Agents on macOS and Linux with Nix