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?

Ask HN: What is the difference between an IMU module and a smart motion sensor?

Italian bill on nuclear energy progressing through parliament

Dearhiringmanager.io Is Hiring a Full-Stack Developer (Remote)

Construct's New 3D Editor

Justification in Arabic Typesetting

Google Axion ARM Processors

HP SSDs lose their performance after 7.5 years / integer overflow

AI Engineering the Acceleration Whiplash

Bumsrakete - CVE-2026-45257

ClickHouse expands strategic collaboration with Google Cloud

Gen Zers are arriving at college unable to even read a sentence

Cat Hair Mustache Puzzle

chDB is an in-process OLAP SQL Engine powered by ClickHouse

CostLoop – track SaaS renewals and stop paying for forgotten subscriptions

Visible Boundaries Earn Trust

Apposters – Generate a full project website from a GitHub repository

Kache – a zero-copy build cache for Rust

NHS Replaces a&E Receptionists with iPads

Show HN: Recreate Thinking Machines 276B voice demo with duct tape and 8B model

KPMG report on benefits of AI contained AI hallucinations

Show HN: Goloop – An agentic loop on your terminal

An Interview with Intel's Kira Boyko: Xeon 6's Product Director

Biggest IPOs in History Are Collapsing. Nobel Economist Says Run

The quiet collapse of British universities

Auto mode for pi.dev. An LLM reviews your coding agent's commands

Docker Sandbox Kit for Mistral Vibe CLI

Is reviewing pull requests slowing you down?

Only Bounds: the most impactful Rust change that you’ve never heard of

When the Watcher Became the Confidant – How AI Befriends and Infers Our Children

Pokémon Go data trained AI that could assist military drones in war zones