Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

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

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

New SpacemiT K3 RISC-V Chip Beats Raspberry Pi 5 in Early Benchmarks

The abhorrent power of the photograph of a 5-year-old held by ICE

ClickHouse PostgreSQL Powered by Ubicloud

Show HN: Vibe coding with TDD and runtime traces with n8n style canvas on Cursor

Selectively Disabling HTTP/1.0 and HTTP/1.1

BU-808: How to Prolong Lithium-based Batteries (2023)

Show HN: Wake – Terminal Session Context for Claude Code via MCP

Exposing a Multi-Stage Malware Campaign on Windows Systems

Roo Code 3.42.0 – ChatGPT usage tracking – Grey Screen Fix and more

EmulatorJS

Financing the AI boom: from cash flows to debt

Llanux, a "Boot to Llama" OS

eBay bans illicit automated shopping amid rapid rise of AI agents

Agentic Memory Is Still an Unsolved Problem

What will tech jobs look like in 2026?

100% AI Coded Game on Steam – Full Dev Log

Mail: RFC822:Address: regexp-based address validation (2012)

Quantum physicists create largest ever 'superposition'

Show HN: A condo review site for Bangkok renters to avoid deposit scams

Finland sets tougher guidelines: No social media or smartphones for under-13s

Amazon Gears Up to Ax Thousands More Corporate Employees

Workplace rights agency scraps anti-harassment guidance

Vibe Coding Kills Open Source

Why External AI Reasoning Breaks Articles 12 and 61 by Default

Show HN: ChartScout – Crypto chart pattern detection under 20 seconds

The Universal Pattern Popping Up in Math, Physics and Biology

From Sketch to Masterpiece: Understanding Stable Diffusion Img2Img

How do I fight 250 duplicate Amazon listings with fake reviews?

ClaudePad

I built a light that reacts to radio waves [video]