Packed Data Support in Haskell

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

77•matt_d•7mo ago

Comments

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

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

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

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

cstrahan•7mo ago

No, one example of why being variable sized integers.

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

carterschonwald•7mo ago

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

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

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

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Modalz Modalz Modalz

Netflix Live Origin

Substack forces users to download app to read content

What is more important than working hard?

Nvidia aquires SchedMD – developer of Slurm HPC scheduling software

Chinese Name Generator

A Simple Recommendation System

Show HN: Explore your own Spotify history

Open Source Security Patch Rewards

What Are Bent Normals?

Is HTML-like markup a bad idea for programmatic video generation?

Writing a blatant Telegram clone using Qt, QML and Rust. And C++

Show HN: A Fizzy to Telegram webhook handler

Show HN: TextGO – A text selection popup tool (alternative to PopClip/SnipDo)

Ask HN: Did anyone learn basic arithmetic as "snapshots" instead of procedures?

Building a Brainfuck DSL in Forth using code generation

Electric Mining Dump Trucks

We Lost Communication to Entertainment

BHP and Rio Tinto welcome Caterpillar battery-electric haul trucks to Pilbara

Erdős Problem #1026

I kept rewriting Markdown docs into Word files, so I automated it

Tesla board made $3B via stock awards that dwarfed tech peers

How Did India Conquer Space?

Oracle shares slide as earnings fail to ease AI bubble fears

Deep Agent Framework, the Pydantic AI Way

Experiments with Memory Integrity Enforcement

Google is bringing Android to PCs with AluminiumOS

Scientists Have Discovered an Organism That Breaks Biology's Golden Rule

Building Software from Blog Posts

Choosing a Web Framework for 2026