Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

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

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

CEOs are hugely expensive. Why not automate them?

Rethinking Tools in MCP

Spherical Cow

Show HN: Golazo – Live soccer updates in your terminal

Slaughtering Competition Problems with Quantifier Elimination

Airlines call in psychologists to stop passengers risking their lives for bags

62 years in the making: NYC's newest water tunnel nears the finish line

Show HN: Upload a song and get a finished music video (no editing, no prompts)

Halifax video game workers form first Ubisoft union in North America

Two strangers. A terrorist bomb. An extraordinary tale of courage

Show HN: Thingo

As AI gobbles up chips, prices for devices may rise

Boost.MultiIndex Refactored

Mercury: The planet that shouldn't exist

Why Your AI Characters Turn To Mush (and how I fixed it)

Controlling Blood Sugar Cut Heart Disease Risk in Half, Study Says

The Detection of Wash Trading

Parsing IP addresses quickly (portably, without SIMD magic)

Grasshopper Docs

A Profit-Based Measure of Lending Discrimination

Doom in Django: testing the limits of LiveView at 600.000 divs/segundo

What an unprocessed photo looks like

The Internet Is a Net Negative

A metagenome-derived, planetary-scale virome resource with environmental context

Researchers Discover Molecular Difference in Autistic Brains

An Experiment in Vibe Coding

Show HN: Built a waifu AI generator in 4 hours

Software Ate the World, Skills Will Eat Work

Julie – an open-source, screen-aware multimodal desktop AI assistant

Show HN: Mini-vLLM in ~500 lines of Python