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?

FiaPhy – Save over $5,000 as a solar investor or simply as a homeowner

Ask HN: How are people getting feedback on prototypes?

Turn an Intel iMac into a 5K Display

Judgment Is a Skill

Cosmic Philosophical Conjecture with Gemini: A Meta-Sci-Fi Documentary Project

Cloudflare API and Pages down

The emotional slot machine of being a sports fan

WebGPU back end in llama.cpp/ggml

The Invention of Numbers [Humor]

U.S. researchers face new restrictions on publishing with foreign collaborators

AI's Role in Revolutionizing Mathematics and the Quest for Ethical Science

Staysin.eu – does a domain's hosting and tracking leave the EU?

Semantic Commit Messages

Show HN: My dad is a forensic accountant. I automated ~62% of his job

Trump's unsigned AI executive order

Mdview.io – a Markdown viewer for AI era documentation

Show HN: Flow2 – We rebuilt presentations mobile first

Anti-"doomer" feedback derails Trump's AI executive order

Agents League: The Esports-Inspired Hackathon Where AI Agents Battle for Glory

The AI Superstars Who Say a 'Vibe Slop' Crisis Is Coming

To achieve major goals, NASA seeks to streamline its organization

Show HN: Appbun turn any webpage into an inspectable Electrobun desktop app

The Fake Nobel That Duped the Romanian Academy

Show HN: Interactive first-principles climate physics simulation with explainer

GLP-1s Linked to Lower Risk of Cancer Spread in Four Tumor Types

A PDF let the internet hear the final words in the cockpit of UPS plane

Dutch FIOD dismantled arm of Stark Industries – bulletproof hoster

Show HN: Lilo – An open source personal AI assistant that lives in Telegram

Fusion energy poised for simpler U.S. review

The Economic Experiment That Upended Reality