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: Lethe is a portable identity layer – user consented

Mark Zuckerberg: The Future Is for Everyone

Meta can't stop states' $1.4T lawsuit from going to trial

World Encyclopaedia of Puppetry Arts

Rootless Container Sandbox for Claude Code and Codex

CVE-2026-53361 AF_Unix GC vs. MSG_PEEK use-after-free container escape

DoorDash Flux: Delegating Engineering Work to Cloud Based Agents

DARPA heavy lift challenge ends with winner at a 3.84:1 payload to weight ratio

LSPs for LLMs

Hannah Arendt's American Education

Supreme Computation – Fail-closed governance for AI execution

Trump's childhood vaccine order: what it does and what doctors say

Ask HN: How do you handle uncertain GPU capacity needs months in advance?

Spy cameras on Royal Navy drones sent data to China

Show HN: DisplayWave – open-source and simple tool for Mac display management

Show HN: Memftprt, a consistent, process-tree-wide memory footprint on Linux

Measuring the Wrong Thing: Internal Harmfulness Scores Anti-Rank Successful

I built a PII pdf parser for your agent

Male redback spider's dramatic death somersault during sex coded in its DNA

Move 37 Is the Moment AI Changes Everything. It's Suddenly Happening Everywhere

Dogs can tell when you're happy, sad or frustrated

Crew, a multiplayer workspace for humans and AI agents to work together

The 7T AI Gamble Is Failing. Big Tech Is Trapped

The StubHub Customers Who Battled for Tickets–and Battle Harder for a Refund

Talk to ELIZA

Statin use vs. death rate from cardiovascular diseases (2019)

We found a bug in FFmpeg with a vibecoded fuzzer

What job postings say about AI at work – Live report

Ask HN: Could DNA be represented as "an embedding" in an AI model?

Electric is joining team Neon at Databricks