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?

JPEG XL Is Becoming a Practical Choice for the Web

How do you check the security of AI-generated code before shipping?

Show HN: CMusee – C/C++ timeless debugger, record every function called

Google Antigravity for Knowledge Work

Show HN: I built a tool that babysits your agents

Mailbag: Halloween 2026

Show HN: FormaNest, Lay out a room in 3D in the browser and share it as a link

Why is AI slop so frustrating to read?

Texpresso: A True Wysiwyg System for Open-Source LaTeX Design

OpenRing – self-hosted voice AI agents with a Vapi-compatible API

Sophon-Realtime v1

ByteAsk: Build-Aware Context and a Checking Harness for C++ Coding Agents

Male donkey is a bull's willing partner in rare interspecies affair

How the Phone Book Taught America to Ask for Answers

Three Short Essays on Jazz

Lab-grown poultry company challenges Florida's ban on 'cultivated' meat

SVG sky map with Ruby and Astronoby

HeyWhatsThat – Calculate viewshed and panorama for any point on Earth (2022)

How to Become a Lost

Attackers Claim to Have Stolen Data on over 1M Vanderbilt Students, Staff

Trump's ties to Nvidia's Huang scrutinized after foreign intelligence concerns

Learning Abstractions: The Next Frontier for AI

Show HN: I abandoned my AVX2 128-bit fixed-point library

Managing Cover Crops Profitably [pdf]

Hundreds of Mundane AI Apps Are Hiding Sexually Abusive Deepfake Features

Does paying more get you better reviews? Rarely

Recursive Self-Improving Terminal Agents via Recursive Self-Rewrite

Endless Portal Worlds

Replacing Dairy with Plant-Based Alternatives Can Lead to Nutrient Deficiencies

What if every Nix build were bit-reproducible?