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?

Show HN: Mdpreview – Markdown in the terminal (images, diagrams, big headings)

OpenAI – Hugging Face Incident Technical Report [pdf]

Dolly Parton dies aged 80 – researchers celebrate her contributions to science

Clerky Is Joining Stripe

Bypassing Copilot Cowork's Sandbox

Waymo says there's no AI shortcut to self-driving

WebSockets vs. SSE should be about ordering and correctness

Nvidia Spectrum-X Ethernet Multiplane Network Architecture at Hot Chips 2026

RevMed's Pancreatic Cancer Pill Priced Above $475,000 a Year

Hunch: Drive your Mac with any LLM: focus-free, in the background, over MCP

Posiwid: The Purpose of a System Is What It Does

Twitter Is Back at Twitter.now

More than 18,000 questionable images found in antibody catalogues of 15 co's

Over a third of webpages created after ChatGPT's debut show signs of AI writing

Elevating app quality: Reducing memory usage and improving device migration

You Probably Forget How Cheap Memory Used to Be

WebMCP Challenge – OpenAI

Show HN: Every push-up becomes an attack in a camera-counted RPG game

Crypto's Killer App: Buying the Government It Once Defied

Programming as a Hobby in the Age of AI

When Vibecoding Is Safe

Amazon service that Jeff Bezos called artificial AI is shutting down

Omarchy – Linux that is capitalizing on AI momentum

Show HN: Invader – an indie iOS podcast player that never phones home

The Texas Grid Has Had a Boring Summer Thanks to Batteries

Re-fueling while cycling made all the difference

150 Years of Global Stock Returns – The Birthplace Lottery

UmmahRank – sponsor a listing, your bid sets your rank

What will be left for us to work on

Steampunk Computer Works as Long as I Have Fire [video]