Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•11mo ago

Comments

nine_k•11mo 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•11mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•11mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•11mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•11mo 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•11mo 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•11mo 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•11mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Why We're Removing Our Programmatic Ads

Show HN: Portable offline LLM knowledge system that runs in browser

China Orders Bitchat Pulled from Apple App Store

DevTerm – Portable Terminal

Clockworkpi

Why the majority of vibe coded projects fail

One Softie's View of the Evolution of Windows APIs

Free Early Learning Content for Kids – Feedback Welcome

My Real-Life Account as a Federally Cleared US Government Whistleblower

I'm building a local-first CLI "knowledge foundry" for LLM workflows

Lab Gloves May Be Skewing Microplastics Data

Robots Eat Cars

A.I. Is on Its Way to Upending Cybersecurity

Anthropic's refusal to drop AI safeguards for The Pentagon

We Don't Know: A Case for Mars

"Do you think AI will ever be able to write a good song?"

Badclaude – whip Claude to make it go faster

What Next for the Compute Crunch?

Guns and Butter: The Oldest Trade-Off in Economics Is Back

MyChart an online patient portal for access to your medical record

Codexia: OSS Agent Workstation for Codex and Claude

From folding boxes to fixing vacuums, GEN-1 robotics model hits 99% reliability

Show HN: I built my knowledge OS from ingesting to next step action

Gave my Claude a subconscious memory system

Benchmarked 37 LLMs on MacBook Air M5 32GB

Browser Agents That Learn

Interpreting Polygenic Prediction of Cognitive Ability

Claude Agent SDK vs. Messages API for a Production AI Assistant?

What "elastic compute" means in 2026

Show HN: Real time purchasing power of $1 USD since 2000