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?

All about the IBM 1130 Computing System

The evolution of agentic surfaces: building with Claude Managed Agents

One Messaging API is not enough

UFC to pay White House fighters in crypto issued by Trump company

Caddy compatibility for zeroserve: 3x throughput and 70% lower latency

Why Research also needs to research itself

What's Coming in Swift 6.4

An Attempt at Explaining Why You Want to Use Forth

Show HN: Passport rankings weighted by where people travel

As Anthropic suspends access to new models, India debates its AI future

Zuckerberg says Meta made 'mistakes' in AI workforce shift

Numerical Hints for Dyon Condensation at θ=2π

We should start measuring knowledge debt like the way we do for tech debt

The AI Delegation Lifecycle: Your Team Has AI Outputs. Where Are the Decisions?

Finding the Slow Query Killing Your Rails App

Arch Linux AUR Hit by Another Wave of Now More Sophisticated Malware Attack

AI enables 1000 people to hold a thoughtful conversation

How Utahns Took on Mr. Wonderful and a Data Center on the Great Salt Lake

American capitalism is run by millionaires, not billionaires

A live ledger of things people wish existed captured from the BlueSky firehose

Why Software, Not Drones, Will Decide the Next War

Ask HN: If 160M Americans are employed, what's the unemployment rate?

Everyone Was Wrong About Maximum Siphon Height [video]

Why my book can be downloaded for free (2014)

Show HN: Afterburner – Capability-Sandboxed JavaScript/TS Runtime in Rust

Claude Fable 5 vs. GPT-5.5: better planning, similar execution

AI is revolutionising the stock market

Meta‑Attention Is All You Need

Qwen 3.6 93B with MTP on 2×RTX 3090 NVLink=187 tokens/SEC,LLM lost bleat-a-thon

How did Atari apply side art to Arcade Cabinets?