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: Wl-pick – a live window picker for Sway

New facial recognition store checkout system piloted by Revolut

Parsing JSON Objects Without Intermediate ASTs in Haskell

iOS 27 Trust Insights API [video]

Don't we require emotions for doing research?

The Lost Atomic Update on Loongson CPU

Kerberized MCP Server with Delegation

We ported the original Doom to SQL

Bring Back the Nokia Lifestyle

Meta takes down a critical video about meta AI Glasses after filming at Meta

Show HN: ListenIn – Mac dictation tuned for mixed Chinese-English speech

Show HN: Muro: Free Native Live Wallpapers for macOS

Show HN: La Machine – a useless box running Erlang on an ESP32 via AtomVM

MCP server for Mario Paint. It draws and composes inside the real SNES game

DAWO: Working together on a digitally autonomous workplace for Dutch government

IKEA set to open supermarket sized stores in the Netherlands next year

Rails World 2026 Opening Keynote

Ideas on modernizing the open-source desktop

The current CSS-Tricks situation

GCC and Clang performance changed over 10 years: my experiment

Code shouldn't know which LLM provider you're using

Vfkit: CLI tool to start virtual machines using macOS Virtualization framework

Researcher finds that cats lie around for a ridiculous amount of time

Show HN: compaction.dev makes cc/codex/cursor resend less, per run

Dopamine sites – The thrill of shopping without paying

Show HN: Full-page screenshots with free annotation and PDF export

The First Microbe for Mars

Benchmarking Java Performance of JDK 8 Through OpenJDK 27

Microsoft tried to ban "Microslop", and six months later it has given up

Love is in the Eyre: China turns to classic novel to teach romance to teens