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?

Why Reading Egyptian Hieroglyphics Is Easier Than You Think

Fake Apple Pay charge brings the classic tech support scam to your phone

A Faster Alternative to DuckDB

Oral History of Andy Hertzfeld, part 1 of 2 [video]

Integrations That Write Themselves

Haiku R1/Beta6 Released

Sometimes Your Best Customers Barely Use Your Product

Cyborg cockroaches with tiny syringes designed to join search and rescue teams

Casey Muratori – The Root of the Root of All Evil – BSC 2026 [video]

What the Model – Local LLM Inventory for macOS

The end of credential sprawl for agents

Stop Turning Off Your AC When You Go on Vacation

The Raycast Keyboard

The Agent Host for persistent, portable agent sessions

Radiant Wins $750M U.S. Army Contract to Deliver Reactors to U.S. Military Bases

Show HN: Invader – an indie iOS podcast player that never phones home

Show HN: OngsList – my own billboard but in the style of Craigslist

Focusing on "focus on what you want to see more of" (2023)

Gao: One in four f-35s can fly all missions readiness

Redburner – A rail shooter in the four shades of red of the 1995 Virtual Boy

Flint: Efficiently Leveraging High Bandwidth Flash for LLM Inference

Fragmented AI Is Creating a "Faster but Not Better" Workplace

"No way to prevent this" say users of only language where this regularly happens

Agentic Payments: How Agents Move Money

Idiolect – measure how you write, then match AI drafts to it

Qwen3.8-Flash-Next: How to Run Locally

Show HN: AI engineer course where every lesson is runnable Spring Boot project

Augmental's Mouthpad Is a Touchpad for Your Tongue

Bill Gates Warns AI Could Upend Jobs, Security and Society Without a Global Plan

Show HN: Trading experiments, 5 years, all reproducible. The answer was no