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?

Tornado VPS services and website are down

A mass archive of weird, wonderful websites

Keeping teams on one AI harness

Airbus migrating 70 critical apps from AWS to Scaleway amid digital sovereignty

Narcissistic leaders more likely to oppose remote work, new research suggests

Proving That America Can Still Do Big Things

Making models smarter and cheaper at the same time

VS Code Lets You Add Page Elements to Copilot, So I Built It for Any AI Agent

Finding zombies in our systems: A real-world story of CPU bottlenecks

France doubles down on restricting access to Polymarketre

Apple probably won't add Jony Ive to OpenAI trade secret theft suit

AI Data Center Power Constraints Are the Real 2026 Bottleneck

Effective Patterns for Advanced MCP Usage

Congress Trades: Which US politician is trading now

Free GPT 5.6 Terra and Luna (2.5M/day) & 250k Sol – free experiments

Podcast Feed from NotebookLM Summaries

Kimi K3 Why Washington Is Watching

Exploit brokers pay $500k for WordPress RCEs. I found one with GPT5.6 and $25

Show HN: Growth-Ratio Energy Function as Leading Indicator of Agent Task Failure

The Search for Another Earth-Like Planet Just Took a Big Step Forward

Topological Control of LLMs: A Route to Trustworthy AI

The Dawn of AI Change-Control

Amsterdam activists throw acid at Microsoft datacenter project

Show HN: Run all your sites SEO on autopilot (boldpilot.club)

Show HN: A pi extension that adds a /for prompt-loop with $each insertion

MSE-GLM – A Deterministic Zero-Weight Graph Language Model

Obsidian stores notes privately on your device

Show HN: The Hanoi Tree

Trump pushes UN 'free speech' declaration in veiled attack on EU tech regulation

Make every row and column a group of three