Packed Data Support in Haskell

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

77•matt_d•10mo ago

Comments

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

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

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

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

cstrahan•10mo ago

No, one example of why being variable sized integers.

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

carterschonwald•10mo ago

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

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

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

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Designing a Game Board for the TMS9918A

More Apple II chainable hard drives?

The True Scale Multiplication Grid

Ask HN: How to serve inference as we do with containes with cached token

OS-Level Age Verification

Old site, new site bookmarklets

Agent-town – A pixel-art AI agent online collaboration platform

Predicting Personality from Book Preferences with User-Generated Content Labels [pdf]

We Moved from AWS to Hetzner. Cut Costs 89%. Here's the Catch

Iranian Women Graduate in Stem 3× the Rate of U.S. Women and Has 5× More PhDs

When Distillation Strips the Soul: Safety Comparison of a Claude-Distilled Model

The User Is Stochastic: Testing Agentic Systems with Simulation and Evaluation

They all said Hormuz closure would be brief. What if they were wrong?

Quint: Executable Specs for Reliable Systems

We built a free AI local newspaper for towns that lost theirs

The HArc Stack – A Web Stack Built on Raku

Show HN: Apc-CLI – sync AI memory across Claude Code, Cursor, Copilot

Ask HN: Building on-device call screening–no cloud, just local ML. Realistic?"

"Warn about PyPy being unmaintained"

New Strides Made on Deceptively Simple 'Lonely Runner' Problem

Don't bet that The Pentagon – or Anthropic – is acting in the public interest

Peter Pan (1928)

Local News

OpenClaw Partners with VirusTotal for Skill Security

Chinese Open Source: A Definitive History

The Hive Mind

Voice Agents Latency

Roblox Is Minting Teen Millionaires

Secure Snake Home (SSH)

How AI Is Turbocharging the War in Iran