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?

Loops? Graphs? Prolog

How to Manage Your Robot

Show HN: Writemark, a dependency free web component for inline Markdown editing

Did They Ghost You?

Ruflo: An agent meta-harness for Claude Code and Codex

Fedora 45 Atomic Desktops Look to Allow for Web-Based Remote Installations

Show HN: Awsmux – Multi-account AWS CLI, up to 5.4x faster, 7.4x fewer tokens

Have your say on advancing AI transparency in Canada

Ask HN: What are some popular AI detection software that you know/have used?

NVLink, NVSwitch, and All That

How are you authorizing AI agents that call MCP servers?

JetBrains Is Sunsetting Kotlin Notebook – What It Means for Kotlin Developers

Show HN: Open-source AI bookmark manager for busy people

'Shameful': Pentagon accused of cover-up over US Military casualties in Iran war

America Is About to Go over a Peptide Cliff

When Middle Age Starts

I Tried Coding My Own Graphics Library

You Cannot Escape the Details

General Resolution: LLM Usage in Debian

The Next Ten Billion Years (2013)

Show HN: Proxmox -> Share your host's Bluetooth with a VM over the network

Show HN: I created a way to turn your GitHub contribution graph into a game

Show HN: Minesweeper Raycasted

Agent's Personality Tax: Stop Re‑Buying Your Agent's Context

Show HN: Tasku. Manage Tasks from the Terminal

Car Hacking and Vulnerability Reporting in 2026

Producing ammonia and fertiliser using wind power in Morris, Minnesota

NanoPutians, organic molecules whose structural formulae resemble human forms

Tokokino

Geohash