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?

Social Policy Builds Financial Markets

Conic Sections Rebellion

So you want to become a Root CA?

Nvidia Nemotron 3.5 Bolt E4B 4GB

Ranji Smile: The forgotten chef who opened America's first Indian restaurant

How to Get a Stable Public IP on macOS Using a VPS and Tailscale

Lspkit – a Rust Toolkit for Building Programming Language Toolsets

Understanding the core 4 choices is where conscious creation begins

Show HN: Readeck sync for Kobo's stock reader

Live benchmark of web scraping APIs and residential proxies (2026)

Show HN: Agent-arcade – Terminal games that pause when Claude Code/Codex is done

Name the UK Space Agency's Active Debris Removal Mission

Do At-Proto Users Know This Is Public?

Why Do I Sometimes Hate Myself

Essays on the Nature and Role of Mathematical Elegance by Edsger Dijkstra

Getting Google Cast on My Soundbar

The First Agentic Native Hobby Operating System

FK Sofa – Truck

Faststrap: Component-based FastHTML extension that provides reusable UI elements

Power of Raycast, Now on iOS

Punchy – a security Tamagotchi that boxes the internet

What if your ChatGPT conversations have a dashboard that can track things

Good writing is a business advantage (2020)

Non-autoregressive NC LLM spits tokens 21x faster than text diffusion

Junglia theme park in Okinawa posted ¥17.3B (US$109.84) loss in first year

Farewell – ETAOIN SHRDLU – 1978 [video]

Ask HN: Is the Microsoft buyout just a long overdue correction?

Push Ifs Up and Fors Down

From the Analytics Department to a Lone Operator with a Laptop

Digital Minimalism