Packed Data Support in Haskell

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

77•matt_d•7mo ago

Comments

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

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

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

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

cstrahan•7mo ago

No, one example of why being variable sized integers.

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

carterschonwald•7mo ago

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

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

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

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Claude 4.5 Opus' Soul Document

X210Ai is a new motherboard to upgrade ThinkPad X201/200

I Tested the M5 iPad Pro's Neural-Accelerated AI, and the Hype Is Real

CME's Data Center Adds More Cooling After Outage, CyrusOne Says

Show HN: What's your mental age? Try It

Ask YN: What CI do you use instead of GitHub Actions?

Looking for Help and Feedback for Node.js Auth Project

'The New Price of Eggs.' The Political Shocks of Data Centers and Electric Bills

OpenAI's lead under pressure as rivals start to close the gap

Deepfake of North Carolina lawmaker used in award-winning Whirlpool video

Needy Software

Chernobyl Fungus Appears to Have Evolved an Incredible Ability

Show HN: Open-source GitHub to Slack notifications

At what point do you stop learning new programming languages?

Show HN: Fabricate a GitHub persona and commit history with 1 command

A curated list of free (libre) self-hosted projects

AI doesn't add up if you neglect the mathematicians

Show HN: FastLanes based integer compression in Zig

Show HN: Free Online detection and content quality assurance tool

How the Firefox desktop launcher works

The Joy of Walking [video]

Russia's only active launch pad for cosmonauts is damaged

15 Years Ago, UFO Sightings Rocked a Small Texas Town. The Mystery Remains

Ask HN: Which large model works best?

Show HN: Scrappy Free AI Code Assistant

Uniform standards for wooden pallets [pdf]

Multicore Fiber MCF Connectors (LC/SC) – HYC

Swiss government says give M365, and all SaaS, a miss as it lacks E2EE

Show HN: Reporters.io – Find and Connect with the Right Journalists

Abused code-signing certificates by country and issue date