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?

Mktemp: Make unique temporary file or directory

Ask HW: Best frontier AI model for mind map generation?

In-camera film simulation app for the Sony A7 II / A7S / A7R II open source

Documenting an undocumented chip: the TensorCore of TPU v5e

Show HN: URL Shortener – A Chrome Extension by Shortener.dev

Show HN: I've updated my Linux System Call website and API

Show HN: LibreCosmos – navigate your space-ship through SSH

Another supermarket hit with freezer attack

Textpattern CMS 4.9.2

Ask questions using the model and knowledge saved on your phone, no connection

Ask Wikipedia in Airplane Mode

The First Nintendo Switch 2 Emulator for PC Has Just Been Released

Jevons paradox is lazy analysis: Evaluating the risk of AI overbuilding

Aulico: Track NVDA, BTC and global markets

MongoDB: One Write, Two Logs

Show HN: Konvene, private browser-to-browser video calls with on-device effects

Entire Police Department Quits After Learning What It Feels Like to Be Tracked

Exploring Super-Agent Design: Towards a More Autonomous Agent System

Ukraine and Russia say emergency apps hacked

Org-Mode November 2026: Fabulously Fancy [LaTeX] Fragments

Moving Authorization Out of Your App Code: If-Statements vs. Cerbos vs. SpiceDB

Let’s Build a Brain

Haas: Postgres 19 is late, and it's AI's fault

The conversation expanded to approximately 559,000 words and 1,492 messages

Anthropic's Mythos-class model allegedly leaked on Hugging Face

European RISC-V Industrial Computing Initiative

How to Block YouTube Shorts

Ask HN: Azure Linux VM's RTC loses 12 hours on reboot if set to 12:xx UTC?

Show HN: AgentTM – A time-travel debugger for AI coding agents built in Go

My Free Tool Turns 3D Scans into CAD [video]