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: Multi-modal Muse assistant on an ESP32

Gemini 4 Argon has January 2025 knowledge cutoff

How do people work through problems?

Show HN: Commit-Aware Router, route LLM traffic around your AI/cloud commitments

The DNA test was supposed to settle everything. It launched a year+ legal battle

Treatise on colors used in watercolor painting (1692)

Flowers for Algernon

SI.gov

Show HN: Popcorn Tracker

Choose Boring Technology (2018)

Show HN: Can a solo founder compete in the crowded Chrome extension market?

Software Folklore

Ironies of Automation

Developing Gemini 4 Argon responsibly and safely

Show HN: Give Your Agents GPUs

Northwestern University Builds Blink-Powered Glasses

Qualcomm Statement on Trial Verdict Win vs. Arm

HomeView (iOS App)

Optimizing a 200k-line Python codebase overnight with Gemini 4 Argon

Muse, in Its Own Files

Show HN: Form to Email

Character.ai Files for Bankruptcy

Zen and the Art of AI-Assisted Development

Kroger to lay off 3K corporate employees over 3 years as it leans into AI

UK maritime agency tells maritime sector to plan for life without GPS

Devin turns agent orchestration into resumable Python workflows

How to Make SQL Easier to Understand for Developers

Scaledown.ai Launches Constrained Decoding Models

Monte-Carlo Simulations

Do You Have Any Ideas?