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?

Almost always look on the bright side of life

After 80 Years, Mathematicians Give Famed 'Erdős Method' an Upgrade

Grantham Warns U.S. Stocks Could Plunge 70% / Most Expensive Market in History

Feds Killed Polestar and Spared Volvo. That Should Terrify You

I built a 100% local network privacy appliance to stop smart home spying

China Has Matched Anthropic in Cybersecurity, Resetting AI Race

What Happens When You Run 10k Concurrent Lambda Functions Against DynamoDB

Amble One

Show HN: FSM – an advanced system monitor for Linux

The AI "Super Bubble" Warning Is a Filter, Not a Funeral

Show HN: SpinnerRecruit – targeted job ads in CLI for AI wait states

Response to AI slop is from Robin Williams

Chrome Extension to Bypass Paywalls

Turning music into a chore is how I became a musician

Microchip June 2026: AVR LA Family [pdf]

Show HN: Decomp Academy – Learn to decompile GameCube games into matching C

Show HN: Shopify UCP is insanely powerful

I designed and synthesized PAC-832 in a chemistry lab I built in my garage

People and Blogs Interview: David Cain, Raptitude

From Prompting Agents to Loop Engineering

Slop, trust, and a three-line patch

Google Patent Reveals Satellite Messages May Carry Device Tracking Data

Show HN: Moumantai – self-hosted, agent-driven apps you can use on any device

AMD Strix Halo RDMA Cluster Setup Guide

GTA 3 on a Volumetric Display (2025) [video]

Australia to double maximum penalty for platforms in breach of social media ban

Never before have so many been trapped in place

Why American data centers can't plug in

The Lost Discipline of the Alarm: What Notification Design Forgot [video]

Nix Taco Sprint 2026