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?

Show HN: Bun-boss – Bun-native fork of the pg-boss queue package

Tim O'Reilly – Google's Westinghouse Bet

QTC – An old-school-cool terminal client for MeshCore messaging – Linux / macOS

What a California License Plate Taught Me About How AI "Knows"

Show HN: OutageDeck – one view of 172 provider status feeds

Divers recover a bottle of Guinness from a 162-year-old shipwreck

Open-source interactive map for the Aug 12 total solar eclipse

OpenAI to pause some work on AI model Astra due to security concerns

QVAC – Decentralized, Local AI in a Single API

Apple's war on OpenAI is about who owns the Attachment Economy

Show HN: Dive into Amiga.games

Show HN: HolyCode Cloud – persistent Linux workstations for AI

KubeTective: Deterministic Incident Investigation for Kubernetes

ACM Europe Summer School on MLIR 2026: Streamed Live, August 10-14

We have a chance to fix the Jones Act

The Costs of Environmental Land Use Regulation

Show HN: Zero-bloat, client-side utility suite with zero telemetry

Whisked: The Food Corridor's Shared Kitchen Summit [video]

The Architecture of Open Source Applications

Picking berries is my meditation

The German Mittelstand

OWASP-amass – In-depth attack surface mapping and asset discovery

Benchmarking LLMs on File System Design and Implementation

Subdomain Center – Largest Subdomain Database

Thomas Wolf thread on the AISI incident

Show HN: agent-hop – reverse-engineered session formats to resume in any agent

Differential heuristics: learning about a way to optimize the A* heuristic

MCP Server Budgeting Tool

AI and War Is Being Oversold

New: Create AI marketing games in your brand style