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 vibe coded a programming language, but I'd rather learn C the old way

Some Basic LLM Etiquette

How AI Became More Expensive Than the Workers It Replaced [video]

The Safari MCP server for web developers

Ask HN: Best Local LLM Setup for a 128GB M4 Max Mac Studio?

Seeing and Being Seen

Honorary Police

What we learned when a user tried to load a 1 GB GML file in a browser

The V Programming Language: A Revolutionary Approach to Modern Development

Open Source LLM Statistics and Trends (2026)

Microsoft's 90s Weapon That Made Windows Fast [video]

Is tech ruining the World Cup?

Epistemic Heat Death and the Signal-to-Noise Ratio of the Global Web

Tesla's Electric Semi Has Its First Fatal Crash

Creating Joy in the User Experience

TurboQuant can reduce vector index size by 10x at 100M Row Scale

Google must pay record €4.1B (£3.5B) fine over antitrust issues

North Korea patents soybean-based chocolate to bypass cocoa and sanctions

Giving admins more visibility and control over Claude spend

Show HN: PriceProbe – zero-dependency competitor price tracker in Python

Why build quantum computers if you can simulate them?

CarPlay Is Additive

Show HN: Drop Flap Boards for All

Ease Comes After

The World's Top Economists Are Sounding the Alarm on AI

We should reduce the amount of generated information

LawZero: Safety from Honesty in a Disinterested AI Predictor

Peter Thiel in Aspen: The pope is 'working for the Chinese Communists'

In Defense of AI Mandates

What is agentic AI today, and what do we want it to be?