Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•11mo ago

Comments

nine_k•11mo 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•11mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•11mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•11mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•11mo 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•11mo 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•11mo 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•11mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Miasma: A tool to trap AI web scrapers in an endless poison pit

Alpaca: Cross-Border Balancing Capacity Cooperation for aFRR

IAMPerformance Issue 001 – Physics-based quantum hardware intelligence report [pdf]

Show HN: WhatToBuy – Describe your situation, get AI-curated shopping carts

Hledger AI Policy

Beasts of the Southern Wild

Native Jellyfin Client for macOS

New Infinity Stealer malware grabs macOS data via ClickFix lures

Overestimation of microplastics potentially caused by scientists' gloves

Cicada Variant 2026: The New Covid Threat Emerging in Silence

Scion: Running Concurrent LLM Agents with Isolated Identities and Workspaces

ESP32-S31: 320MHz 2C RV32IMAFCP+CLIC, 512KB SRAM, GbE, 802.11ax, 61 GPIO

What fork() Actually Copies

Are LLMs a Dead End? [video]

How Developers use AI

Lithuanian Legislation as a Git Repo

Should you do a PhD? (2025)

DaVinci-MagiHuman: Open-source AI model for realistic video generation

Working on Products People Hate

Vibe physics: The AI grad student

A minimal React shopping list app structured for Capacitor/iOS packaging

From Agent to Domain Intelligence: A Self-Evolving Knowledge Engine

City Skylines II: Office Evolution and City Stations Available Now

Debugging and Fixing Interaction to Next Paint (INP)

Iceflake's First Patch for Cities Skylines 2 Is Good [video]

Lat.md: Agent Lattice: a knowledge graph for your codebase, written in Markdown

Tried a New AI Image Tool for Real-World Design Work (Nano Banana Pro)

LinkedIn uses 2.4 GB RAM across two tabs

How to use ETag header for optimistic concurrency

30 Years Ago, Robots Learned to Walk Without Falling