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?

A Self-Improving Code World Model Agent

Show HN: Kiwi – Run agentic dev loops in the cloud, keep keys on your laptop

Plex debuts 5-year membership pass for $250

Australia teaches Amazon the meaning of the word "contract" [video]

Show HN: I built notion database based no code form builder

The Hitchhiker's Guide to Agentic AI

Show HN: TV Time to Serializd Importer

your competitor is 10x better than you

What else happened in 1776 [video]

Venice AI becomes a unicorn with its privacy-first AI platform takes off

China fires ballistic missile into Pacific nuclear-free zone

Roll your own file-based router in under 50 lines of code

Who Survives Europe's Energy Crisis?

On Writing (Code)

Edit Markdown like editing a Word document

Inertial Navigation System

Show HN: I built an AI that knows my net worth: 3 countries, 6 currencies

Pyramids – GIS Utility Package

Sentiment analysis of Reddit threads using BERT models

Quitting a Forever Game

Compressor V2: three compression layers for a 50% LLM agent cost cut

Pokémon Go '10th Anniversary Party' event guide

Show HN: RNet, an AI credit wallet for everyday users

The evidence against "ultra-processed" foods is weaker than you think

Jetterix Pressure Nozzle ReviEwS (2026) We Tried It My Honest Review

Why did the jump from Intel MacBooks to Apple Silicon feel that huge?

How to Download Canvas and Panopto Lecture Videos

Trump's 'narco‑terrorism' war in Latin America evokes Reagan

Pioneer of 'extreme male brain' theory of autism now says phrase unhelpful

India's IT industry is shrinking general hiring while AI roles rose 16%