Packed Data Support in Haskell

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

77•matt_d•1y ago

Comments

nine_k•1y 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•1y ago

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

Zolomon•1y ago

They mention this in the article.

spockz•1y ago

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

cstrahan•1y ago

No, one example of why being variable sized integers.

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

carterschonwald•1y ago

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

tlb•1y 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•1y 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•1y 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•1y ago

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

lordleft•1y ago

This was very well written. Excellent article!

NetOpWibby•1y ago

Is this like MessagePack for Haskell?

An independently hosted version of the PhotoCraft image editor

The Harness Came Too Early – Scion is a bandaid to a larger issue

I let Claude hire its first employee. It chose a rock

AI has changed my engineering leadership role

Show HN: Composition – a daily Jezzball-like puzzle that turns into a Mondrian

Show HN: Bird – a Linux reminder app with an animated bird

Is Hacker News still a good predictor of tech trends?

Even Without AI, the Risk of a Biological Attack Is Terrifying

Show HN: Noble Gas

Show HN: Reproducible failure drills for AI coding agents

The cost of getting a job today

Some interesting internal documents from Anthropic litigation

Everyone is doing Git on S3 wrong

No timeline for lifting Land Registry paywall as ownership remains opaque

Something is falling apart at GNOME, and it's not subtle

Show HN: Content-adaptive display brightness for macOS with DDC/CI support

Furifont, a Japanese font that shows furigana

Show HN: Bateri – a terminal, which you can drag&drop files to upload/download

Show HN: Ampsu – Privacy and EU-focused, adaptive TDEE fast calorie tracker

WSP MCP – Free WordPress MCP for Connecting AI Coding Agents

Jazz² Resurrection

Movietonight

Bidirectional Type Slicing

A death, a plagiarism scandal, a quest for revenge: the tale of Otto Z

Kerno 1.0 – AI Back End Runtime QA Engineer

AppReviewer Preflight – Catch App Store rejection risks before submitting apps

Plasma 6.8 released (KDE's 30th birthday)

REA – I tested AI agent reverse engineering

The 'leap second' could disappear

The Shortage of Oncologists: Australian Medical Oncologist Workforce Study