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?

CEO of Mistral: AI is software. It can be controlled

The Discovery Tax: Why Coding Agents Waste 2,500 Tokens Before Writing Code

Google's orbital AI data center test packs four TPUs and 1,000W of solar power

How to Freelance Now?

Typed-lm: a Rust jev open source alternative

LaserActive

Catching Rogue Agents in Real Time with Synchronous Control Monitoring

Enabling the next-generation trait solver on nightly

What Does Your Data Reveal About Sports Betting Apps? Help ProPublica Find Out

Gameboy Macro (2016)

Maze Toys

In Silicon Valley, the End of Humanity Has Always Been Part of the Plan

How to Feel Good

Many surgical interventions are little better than placebo

The computer hacker who tried to take down Man City

The use of humor in depression: An integration of benefits and risks

JuhRadial MX: Linux control for MX devices and generic

Show HN: Docspira – JSON/YAML/regex tools that never leave the browser

OpenAI says its AI agents posted user images online in error

New species of parasitic wasp discovered in Assam's Dibru-Saikhowa National Park

Harari vs. Henrich: What science says about human evolution

No errors, no warnings, no gods, no masters – HTML Purity is a Fetish

That About Wraps It Up for Stock Mac UI

Show HN: Blue Lock Farm – a Roblox wiki, database and tools

Chinese AI models surge in global popularity – and Washington is worried

The Americans Having the Most Sex

Show HN: Asụsụ Ọma, a free app for learning Igbo with native-speaker audio

The Cost of Blue Light: Multiorgan Pathology Induced by LED Exposure

OK, so where are all these data centres?

What and Whose Knowledge? Measuring Epistemic Diversity in Large Language Models