Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

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

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

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

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

cstrahan•9mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

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

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

Show HN: Image MetaHub – Search Local AI Images by Prompt, Model, LoRA, Seed

The Sazabi Manifesto

Show HN: Tabstack Research – An API for verified web research (by Mozilla)

Pick Your Agent: Use Claude and Codex on Agent HQ

DHS Hunts Down 67-Year-Old U.S. Citizen Who Criticized Them in Email

Claude Code's /Insights

Release Pandoc 3.9

YC S26 Application: "Attach a coding agent session you're particularly proud of"

Why does this site require security questions?

VS Code for Linux may be hoarding trashed files

I made an open-source juypter alternative

Map Shows 21 States Where Deaths Now Outnumber Births (2025)

The Great Unwind

Cracking the Clit (2017)

MariaDB Cloud BYOA: run managed MariaDB inside your Azure subscription

cad0: A Text-to-CAD Model

A2RL – Autonomous Drone Racing Championship [video]

Min Blogger-Mania-Profil

Show HN: A free focus app that locks work if you skip breaks

Show HN: tmpo – Local-first CLI time tracker with automatic project detection

Ask HN: When will LLMs generate professional-level CAD models?

Who Bit My Border? (2012)

Mazeru: Clojure full-stack server-state using Deno and Datastar

Server CPUs join memory in the supply shortage, pushing up prices

Feedsmith: Emacs RSS reader with Feedbin sync, pluggable back ends

Show HN: Workout app for when you're short on time

NASA's Perseverance Rover Completes First AI-Planned Drive on Mars

Intel will start making GPUs

Roblox's 4D creation feature is now available in open beta

Implementation of the Apollo Guidance Computer in an FPGA