Packed Data Support in Haskell

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

77•matt_d•7mo ago

Comments

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

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

Zolomon•7mo ago

They mention this in the article.

spockz•7mo ago

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

cstrahan•7mo ago

No, one example of why being variable sized integers.

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

carterschonwald•7mo ago

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

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

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

lordleft•7mo ago

This was very well written. Excellent article!

NetOpWibby•7mo ago

Is this like MessagePack for Haskell?

Electrocute: See all electron-based applicatios that you have running

Tether's Answer to Centralized AI

The major U.S. trends in AI in 2025 – and what's next in 2026 – Context by TRF

We are launching Bindu – where Agents talk, identify, trade

Game Boy Color development tricks via de-making Pokemon Mystery Dungeon [video]

Where Code Meets Creativity

Vinyl Arrivals: Dec. 12, 2025

Independent voters ask court to declare Pa.'s closed primaries unconstitutional

Information Flow in Logical Environments (2016)

Tembo Automations: Background agents that automates away repetitive tasks

GitVex

Writing MCP Servers in Rust (stdio, rmcp)

13-year-old Safari bug: getBoundingClientRect [video]

I've spent $25k on X ads as an indie dev

How the Next Big Thing in Carbon Removal Sunk Without a Trace

Google is building an experimental new browser and a new kind of web app

Ask HN: Relatively SoTA LLM Agents from Scratch?

Learn to have blind faith

Atlantropa

Why reviewers underestimate the power consumption of Apple Silicon Macs

Medical Students' Disease

Invisible Job Market Scanner

Sperm Donor with a Cancer-Causing Gene Fathered at Least 197 Kids

What should a security CLI include for SMEs and NIS2/DORA?

Show HN: Sss – S3 Client

Show HN: I built a mitmproxy AI agent using 4000 paid security disclosures

Climate Change and Energy

MIDI Intro for Makers

The Solution to Finding an Atmosphere on Trappist-1 E

Debugging CALayers in ChatGPT