Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

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

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

Libcurl Memory Use Some Years Later

Waymo founder John Krafcik: Tesla's Full Self-Driving has 'bad case of myopia'

Infinite Jest

Show HN: I built an AI that calls you and practices spoken English with you

Why Big Tech Performance Reviews Aren't Meritocratic

Time Until Someone Points Out This Is Not a Real Study

Agree or Disagree

Dev Logs Without the Noise (2024)

Ruby_LLM-agents: A Rails agent framework for RubyLLM

The secret fast track for animal drugs (2025)

Rise in Sophisticated Dark Patterns Designed to Trick and Trap Consumers (2022)

Change Blindness in UX (2018)

Rust's Standard Library on the GPU

Community Pulse 2025 End of Year Wrap-Up [audio]

Every Enemy from Super Mario 64, 3D Printed [video]

StatechartX – performant state machine runtime written in Go

Show HN: Open-source multi-agent subtitle translator (self-hosted)

MIT's new 'recursive' framework lets LLMs process 10M tokens

I don't like skiing in the shade, so I built a ski trail shade map

Tour website's AI sends visitors to Tasmanian sites that do not exist

198-Bit Constraint Framework: New Physics from First Principles

Trump FCC threatens to enforce equal-time rule on late-night talk shows

NexDock is building a new Windows phone that you can buy in 2026

Elizabeth Holmes asks President Donald Trump to let her out of prison early

Tsfresh

The Art of Craftsmanship (Monozukuri) in the Age of AI

Myth of the Monolithic ERP: Why They Keep Failing [video]

An A.I. Startup Says It Wants to Empower Workers, Not Replace Them

Testosterone went from prostate cancer villain to potential ally

Flashlabs releases the world’s first open-source voice cloning model