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?

New York State Sue Polymarket for Running Illegal Gambling Operation

The Appocalypse

Study reveals evolutionary history of bats, dating back 65M years

Show HN: AtlasBurn – Know what your AI costs and stop runaway agents

Netanyahu calls Israel's war in Gaza 'opposite of genocide' in UN speech

The Purpose Isn't What It Does

Tech Needs Humanists More

Privacy.com does KYC using Peter Thiel's Persona [video]

Show HN: LabLoop – isolated infrastructure for LLM-driven scientific experiments

Dutch Hackers Collective Hacked

Boards of Casio

AI as a Tool in Taste Research: decoding the taste of bitterness

Show HN: Selfime, a cassette-style recorder for meditations in your own voice

Show HN: Proxima Forma – Designs that my AI agents understand

Bootstrap Chain for NixOS: Building the System from a Hand-Auditable Binary Seed

What is the future for soace science missions after all this?

In Support of Agent Led Software Engineering

NHS bodies in England impose 2-year minimum wait for ADHD and autism assessments

Show HN: Apowerb, the open-source AI agent runtime (RAG, Text-to-SQL, webhooks)

The last day of the dinosaurs, as an interactive painting

Special Projects (2016)

Colibri: CERN VHDL Common Library Released for Everyone to Use

Running local LLMs on your Mac: what fits, what's free, and what's overkill

Ex-Microsoft dev builds a new task manager for Linux

A master class in decorators, patching and tracing

Who Is Open Source About?

The Orient Cables IPO Explained

HackMIT 2026

The Collie and the Pug – HackMIT 2026 Keynote

Philosophy Bench