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?

New sw dev tool for safe local AI usage

Open AI announces two new models- GPT-transcribe and GPT-live-transcribe

LearnVector – Andrew Ng's AI company building one‑to‑one learning experiences

Autoclaw

I Built a Free AI Pain Point Miner

Ask HN: How many AI agents do you actively use?

Symbols That Speak Color

LeanScreen: Lean Verification

Show HN: MD Flow – native macOS/iOS app for browsing and reading Markdown files

Modern Software Registries Are a Trust Service

RuntimeWire launches a live dashboard with auditable readership metrics

Qector v3: Exact parity quantum error correction on a 3GB dual-core edge CPU

Show HN: OpenOTP – Autofill email verification codes on your Mac

Show HN: DeskDock (Always on Dock) – A tool a treat for Windows productivity

Building Galley House

Generate Nix binary caches without Nix copy

Show HN: TrueDeck – open-source multi-agent terminal deck that abstracts memory

Show HN: Bocazasgames – Four multiplayer browser games with AI moderation

Trump's diversity crackdown reverberates through US boardrooms

OpenAI's rogue models roamed the internet for 4 days and staged a second attack

How do you rewrite C/C++ projects to Rust?

Samsung's Galaxy Ring Gets FDA-Cleared Sleep Apnea Detection This Fall

Advice for New Managers (2025)

GitHub Copilot app usage metrics now expand across report rollups

NPM publish-time malware scanning and dual-use metadata

Show HN: Learning Rust by writing a Markdown to HTML compiler

My girlfriend broke up with me – This is my body's reaction to the news

Multiple Mouse Cursors in Wayland

An idea I had took me from chaos and stressed AF to insanely productive

AI systems out-persuade expert humans