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?

Agentic pre-commit hook with OpenCode Go SDK

Writing a 3D Point-Cloud Library in Rust

Dart Back End in 2026

An Open Letter to Georgetown Students, in Response to "Generative AI"

The Death of Character in Game Console Interfaces

Human code review is still cheaper than fully automated verification

GitHub appears to be struggling with measly three nines availability

Roots – Return Old Online Things to Your Own Site

My Sage Barista espresso machine is now smart

Drop Select2 in Rails – zero dependencies, vanilla JavaScript, Turbo ready

IrfanView: About the Author

Velr – an embedded property-graph database in Rust on top of SQLite

I Built an AI Receptionist for a Luxury Mechanic Shop – Part 1

New SVD Algorithm

Trivy report prior incident part of 'ongoing and evolving attack'

High-performance JSON library for Elixir via Rustler NIFs, powered by sonic-rs

Man designed cancer vaccine for his dog with aid from AI

Shadows Shouldn't Stack

The Problem with Representative Democracy

Convergence of Wi-Fi and 5G

Escaping Nulliverse

State of the Global Climate 2025

EPP wants to overturn and force new vote for indiscriminate Chat Control

Convergence takes off in the datacenter

Westerners are fleeing their countries in record numbers

Migrating to the EU

Trepan: Context Drift Catcher

OS Kickstart

Show HN: Agent-IM – IM, but for Agents

Why using AI to modernize legacy mainframe hairballs is harder than you think