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?

Genkit Middleware: Intercept, extend, and harden your agentic apps Blog

Programmable Phones

The rise and fall of an AI-driven 'local news outlet' in South Florida

What Are AI Ethics

Ask HN: One mistake or hack that taught you the most?

Agentic evals or LLM as a judge? considering cost, time and quality

Lookup.disclose.io – find the right security contact for any asset

Agentic SDLC: How OpenSearch accelerates engineering with its own engine

Show HN: QUptime, quorum based decentralized uptime tool

Multi-LLM trading harness with live leaderboard on Alpaca paper trades

What Are the Different Types of AI Testing Tools?

The Power of the Breath

Social Media Bans Are for Kids. What About Adults?

How climate-resilient homes in India are reducing dependence on air conditioners

OpenAI just lost its enterprise AI crown to Anthropic

Edith Eger, Auschwitz Survivor Who Helped Others Cope with Trauma, Dies at 98

Britain investigates Microsoft over business software dominance

Random AI Explained Fast

Perfect Number Bomb(2025)

FilePilot AI – local-first desktop file manager with optional AI summaries

How the Ingredients of Life Make Our Journey Worthwhile

US reportedly dropped fraud charges against Adani after he hired Trump's lawyer

Logic bug in the Linux kernel's __ptrace_may_access() function (LPE)

Ask HN: How do you catch regressions when you change your AI agent's prompt?

C++26 Shipped a SIMD Library Nobody Asked For

Solar Is Everything

Claude free usage limits are nuts. useless

PSVL 1.0 – The most comprehensive source-visible license (276 clauses)

How Claude Code works in large codebases

Solar rhythm of sleep compared to modern social norms