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: Nod – Mac meeting notes that don't join the call or store audio

A Brief Introduction to q and KDB-X

Improvements to Web for AI Should Benefit All Users

Ukraine hits Moscow with largest-ever drone attack

VSE II: Serial protocol achieving 89.93% line load reduction

Show HN: Vessel – Portable app files (UI, FastAPI, SQLite) like .xlsx for tools

The Future of the Con Is Here, It's Just Not Evenly Distributed

Legacy Update – community-run Windows Update

Sourcehut Disrupted by LLM Crawlers

Eve Content Agent Template

Human Dignity and the Perils of Indifference

The Roadmap to Mastering AI Agent Evaluation

Guardian Angels

Six months on the Strix Halo chip AMD now markets as "first-class ROCm"

The Open Source Alternative to Claude Design

15-minute at-home Lyme disease tick test

Europe must choose between AI and climate goals, data center lobby says

Trump's Anthropic restrictions may be illegal

A Drone Barrage on Moscow Escalates Ukraine's Push to Take the War to Russia

Rankpad – AI Visibility Tracking for Brands

Offline Ablation Predicted -0.19pp. Production Delivered +1.11pp

Excel in 100 lines of F# (2018)

Microsoft new Outlook takes 10 seconds to do what Outlook Classic does instantly

The Welding Torch That Feels for the Seam – Industrial and Manufacturing

Grok Imagine Video 1.5

Technical Dimensions of Programming Systems

I'm building a drone for the DARPA lift challenge [video]

Traumatic brain injury and risk of attempted suicide and violent crime (2023)

Show HN: Reverse engineering user queries for ChatGPT/Gemini

AI therapy chatbots in 2026: what Replika, Woebot, and ChatGPT get right