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?

Colleges need to teach last-mile knowledge

Show HN: Bullet Script (bs) – a Lisp(y) VM for shmumps

O.J. Simpson, a Secret Informant and a Decades-Old Mystery

Vizen – Open-source overlays for Windows, crop any window over your game

My Favorite Restaurant Served Gas (2023)

Monthly Roundup #47: October 2026

Top Mathematician Announces New Institute for A.I. Safety

OpenAI's blockbuster math proof isn't what you think it is

United's CEO Says It Should Cost More Not to Sit in the Middle Seat

VMMouse for NT 3.x: QEMU/VMware mouse integration driver

Netflix Lays Off About 6% of Staff in Biggest Job Cuts Since 2022

Show HN: Keel – One event-sourced context graph for all your agents

Consumer apprehension grows as US retailers adopt AI-assisted pricing tools

Leviathan LLM Inference

Ask HN: A plea to help me help my father

Mikhail-Who?

A commodity price tracking website with a few fun tools

Beating Warcraft III's insane AI with self-play reinforcement learning on one PC

Show HN: DebtShark – Consumer Legal Defense and Debt Settlement Workstation

Show HN: Lungo Generates Rust, Python, from Lean Proof Source

LLM01: 2025 Prompt Injection

Show HN: Dieline generator for packaging (type the size, get the drawing)

US threatens Europe over Starlink restrictions

Two Mac Studios Are Not One 1 TB Computer

The Leap Second Has Been Canceled

Scholars conclude 'beyond doubt' that Shakespeare was main author of Edward III

Aircraft gyroscopic instruments modeled from M series MacBook IMU

Neurastheniacc: LLM-based C->WASM compiler you didn't need

Follow the Money Database – See who funds your congressperson

Flock camera locations revealed on MapQuest's new Surveillance Layer