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?

Claude's Corner

AI pays for its self-existence

NASA spots new signs of lightning on Mars

Obsidian Sync now has a headless client

Anthropic vs. DoD: "Any lawful use" is a fight about control

Yarn 6 has been implemented in Rust

Show HN: Stacked Game of Life

The Epstein Tax

Giant string of organic molecules on Mars may be one of best signs of life yet

The Saga of Kowloon Walled City

Unfreeze for ChatGPT – Fix freezing on long conversations /30KB Chrome extension

I caught an Illegal Russian Spy [video]

Why consumer choice is stripped away and how the tech industry profits from it

Polyworld

Clustering Developers by Repo/PR/Issue Signals

Show HN: Spectra – Turn bank CSV/PDF exports into a local finance dashboard

Show HN: Fava Trails – Git-backed memory for AI agents using Jujutsu (JJ)

Show HN: SQLite for Rivet Actors – one database per agent, tenant, or document

AssistPlant – Plant Care App in Your Calendar. Your Inbox. The Browser

I coded a game to turn the Epstein Files into Mad Libs. It's hilarious

Claude and Gemini debate AI consciousness then analyze their debate performances

Ask HN: Whats the best friction approach to breaking phone habits

Show HN: MailFomo – Drive urgency in emails with live countdown timers

Istota is a powerful (non-claw) AI agent that lives in Nextcloud

OpenAI Reaches A.I. Agreement with Defense Dept. After Anthropic Clash

Why rich people live longer

Build a DuckDB Extension in Rust in 4 Commands

Agents of Chaos

run0 (sudo replacement)

You Shouldn't Exercise to Lose Weight