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?

IronCurtain: A Personal AI Assistant Built Secure from the Ground Up

Instant DB clones for AI agents

Should everyone be taking statins?

Even with Coding Agents, You Still Can't Recreate StackOverflow in a Weekend

DOS Memory Management

Show HN: AO – Deploy Python agents without managing production infrastructure

Show HN: DumpCleaner – Native macOS/iPadOS app to filter SQL dumps

Why every AI coding breakthrough feels normal within 90 days

Altadena asked Edison to bury lines. That could cost some fire victims $40k

Instant LLM Updates with Doc-to-LoRA and Text-to-LoRA

Launching the Agent Protocols Tech Tree

Living with Hyperphantasia

Making Iceberg Work for Operational Data

I hacked ChatGPT and Google's AI – and it only took 20 minutes

Why every scientist needs a librarian

Against Land Value Capture

Show HN: OpenAI to Buy Babuger.com for $1B? (Just Kidding, I Built It)

Coherence at 300K

The Robotic Dexterity Deadlock

Hyprland 0.54 Released as a "Massive" Update to This Wayland Compositor

Will magnesium supplements help you relax?

Show HN: Dashboard – a runtime plugin-based desktop widget system for Linux

I never estimate on the call. Best engineering rule I made for myself

FBI was hacked and 100tb from the Epstein file deleted [pdf]

Show HN: Night Watch, zero-dependency DevOps agent

Show HN: Vector database vibe-coded in WASM, 5x faster than JavaScript

NASA announces major overhaul of Artemis moon program: "We've got to get back to

Perhaps People Are Cynical About Success in the Creative Arts for a Reason

A public startup survival tracker (30 days inactive = dead)

Natural Speech Analysis Reveals Differences in Executive Function in Adults