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?

Karios AI Agent Carzy

Claude is just Mr. Meeseeks

Soofi – Sovereign Open Source Foundation Models

NYC Launches "Public Interest Technology (Pit) Crew" to Build Digital Solutions

How does an LLM feel about you?

Economists are coming around to the idea that AI really is killing jobs

The Estranged Worlds of J. G. Ballard

A Large-Scale Empirical Study of AI-Generated Code in Real-World Repositories

$65K to work at Anthropic? Debate ensues amid IPO wave

Primate 0.40: Route pages, store enums, async schemas and events

DOOMQL – what if SQLite were the game engine?

SHOW HN: Every Repo as a Unique Galaxy

Frankie: AI analyst you can email to get work done

The Work of Helping A.I. Destroy Work

MindRoom: AI agents that live in Matrix and work everywhere

The case of the 500-mile email (2002)

Pentagon suspends CMMC phase two requirements, launches review of program

MIT's New Method Flags AI Models Trained on CASM Without Generating It

A Study of Microsoft's Early 2026 Rollout of Claude Code and GitHub Copilot CLI

Yes, You Can Trick AI into Exonerating Someone

OpenAI's new Agent Sandbox Cloud [video]

Noisia: Harmful Workload Generator for PostgreSQL

Starship – Critical Path [video]

AI use case library – Who is deploying AI, and what happened (150+ cases)

Human Emacs

France powers down several nuclear reactors due to extreme heat

Grok Build uploading full repos and .envs to GCP

Trump notifies Congress of new war against Iran

AI Agents for Increasing Revenue

The Tick That Hunts Down Its Hosts–Including Us