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?

Most Software Was Already Slop

Wikivibes – Write the encyclopedia you wished existed

Satellite Images of Penguin Droppings Reveal Impact of Antarctic Warming

Everyone has a book in them, more so bloggers

Muro 4.0 is out: Native Live Wallpapers for macOS, now on Intel Macs too

A Proof of Conway's Refinement Conjecture in Lean

Vectra – Offline CVE and GTFOBins intelligence engine for your terminal

Genetically modified pig kidney keeps man alive for record nine months

Show HN: DeepMem plugin for Claude Code – persistent semantic memory via MCP

Tell HN: Check Claude CLI, it may have silently enabled remote access

Some US car buyers envy what they cannot have – affordable Chinese EVs

Scientists map key protein interactions linked with profound autism

US urged to consider military strikes to stop China achieving AGI first

Gridfinity

The Story of VS Code | Official Documentary

ICE Wants to Know Everyone Who Bought a Certain Green Beanie from REI

Linux 7.4 to Improve Apple Silicon Audio Support and "Impossible" Power Mgmt

Edmond Albius, the Enslaved Man Who Pioneered the Pollination of Vanilla

How Email Works (2025)

Australian property developer collapse ripples into private credit markets

Testosterone shifts political preferences in weakly affiliated Democratic men

GMails custom domain "send as" discontinues January 2027

Hostile Interpolation

Safety overview: GPT‑6 Astra

MVSEP's 53-Stem Music Separation Model

Show HN: JogPad – Shift Shift note capture app (macOS)

Show HN: Dev-prune – deletes node_modules only when the lockfile can rebuild it

Reverse Engineering an ASIC

Local TUI issue board for agentic workflows with time travel, backed by Git

Unlocking Lossless Speedups in LLMs via Discrete Diffusion