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?

Writing for Humans and Machines

China Eliminates Tariffs on Africa to Outmaneuver U.S.

Couple of Emacs Hacks (2003)

Assertables v10: Rust crate for assert test macros on Codeberg/GitHub/GitLab

ExtendDB: An open source DynamoDB-compatible adapter with pluggable storage

Announcement: We've Updated the Rules, and April Is Finally Over

Decision Precision

Building a Search Engine from Scratch – 1

Reality has a surprising amount of detail (2017)

Poor's Man Opaque Types

C as an Intermediate Language (2012)

Childhood and Education #19: Letting Kids Be Kids #2

Stable Code from Stable Problems

'The vibes are young male vibes': Why prediction markets attract a certain type

From Open Source Software to Open Source Strategy

Google Is Paving a New Information Superhighway

Monthly News – May 2026

Why are Flathub downloads so slow sometimes?

Soupault: A static website management tool

Google is pitching an AI agent ecosystem to consumers who may not buy it

HTML-XML-Utils

An automated A.I. WWE news channel on YouTube tries to pronounce "WWE"

Claude Code MIT Dashboard

Google's AI Search Is So Broken It Can 'Disregard' What You're Looking For

Picovoice Discointinues Free Tier

LogiWebConnect – Working on Linux

Reverse engineering circuitry in a Spacelab computer from 1980

Data centers could be good for your hometown

'A Total Nightmare': Voices from a Moscow Hit by Ukrainian Drones

What Lamarck's Giraffe Got Right