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: Gitwal – every open-source project mention on X, LinkedIn, Reddit, etc.

DHS orders removal of DeepSeek from government agency IT systems

Show HN: Accessibility Context for UI with AI

Where Jev Fits in a Large-Scale Data Pipeline

Schematic, Mask, and Die Shot of Intel's 4004 CPU

Lessons from Watching an AI Agent Swarm Self-Organize

Drupal is now light-years ahead of its reputation

AI Discovery in Combinatorics: From Problems to Solutions and Back

Hetzner object storage outage since last 10 days in HEL data center

Priest killed by falling crucifix during sermon on fragility of life

The Maya Collapse Was Blamed on Drought. The Full Story Is More Complicated

Building Your Own Sandboxes

Does Ruby on Rails still make sense?

A Guided Tour of Sketchpad

Beginning of the Ende: A community fork of Deno

Ask HN: Any good technical podcasts to listen to while driving?

I Teach at a Business School. It's Time to Shut Them Down

Show HN: Claude Code skills and hooks that prove a fix's test fails without it

USPS can now bill senders for unpaid foreign duties, even if disputed

Dwarves on the Loose

Show HN: SiteSolide – Open-source cloud for small software

CoreWeave's bonds scream financial distress

Technocapitalist AI-Powered Blues

Quizera – Create and deploy AI-assisted assessments in minutes

OpenBSD 8.0 release will have inteldrm/radeondrm/amdgpu drivers from Linux 6.18

Diablo 2 Survivors

California Rules Discourage Condo Construction

Putting Linux on my RTX spark laptop because I don't have a Microsoft account

Gravity and quantum information linked through a derivation of Einstein's equati

Terminal makrdown reader – feedback welcome