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?

I'm Building an App to make $10k/month and I'm Recording the whole thing

Show HN: Fail2ban-Dashboard

The evolution of window and class extra bytes in Windows

Building AI for Production Requires More Engineering Than AI

Bloomberg: Spain Built Too Much Solar. Investors Want Out

Scientists say most people need more protein than current guidelines suggest

What If a City Ran on UTC for Two Weeks?

Getty Images Plans to End Shutterstock Deal After U.K. Imposes Conditions

Thoughts on the Near Future

Anthropic launches Claude Science, Google and OpenAI racing to compete

34,266 repos were scanned: 1 in 4 orgs showed gaps in AI agent config files

Turning Supacode into a Full, Agent First IDE

Ente Is Open

Open-source Claude/Codex/Cursor limits tracker for Mac

Ocean surface temperatures hit a record high for June

Getty's Shutterstock merger falls apart

Free online tools in one place

Siplinx AI Meeting Notetaker for Zoom, Google Meet

Neuralink: Our First Transdural Procedure [video]

The Primitive Is the Product

How Spotify Is Killing the Open Podcast Ecosystem (2020)

Sonnet 5 Is Dead in the Water

Side-Channel Protections in Hardware Implementations of PQC ML-KEM Verification

Hays Code

The Economics of Starlink and SpaceX

Palantir on AI Sovereignty

Isaac Asimov Laments the "Cult of Ignorance" in the United States (1980)

C++26: Constexpr Virtual Inheritance

A return to two-pizza culture

Nsram: The Artificial Neuron on a Silicon Chip