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?

Megawatts by Microwave

Ask HN: How Do You Connect OpenAI Secure MCP Tunnel with Claude Desktop

Small Change [pdf]

Fixing analog audio on the $2.58 HDMI-to-VGA adapter

After hooking China on coffee, Starbucks ramps up consumer strategy

The '1776 Diet': What Americans ate during the nation's founding

A gender-swap EarthBound for my daughter (2025)

Show HN: Codex-review – a read-only cross-model review skill for Claude Code

Beeg float library, a Rust port of Fabrice Bellard's libbf

Cuba's Green Solution to the U.S. Oil Blockade: Solar-Powered Electric Tricycles [video]

New California study finds highly educated workers most harmed by AI

US and Chinese companies train almost all of the most-used AI models

Mouse: Precision Editing Tools for AI Coding Agents

Meituan Trained a 1.6T-Parameter AI Model Without Nvidia GPUs

China's LongCat-2.0 Becomes the Biggest AI Model Without Nvidia Chips

Shadcn/UI now defaults to Base UI instead of Radix

Binary Coverage the Wrong Way

Oxc (popular front-end tooling) forked my parser but removed my copyright notice

Moby Dick Workout

My ASN Journey series (2024)

The Electricity: Why Google may be trying to make intelligence disappear

Reading Minds with Ultrasound: Less-Invasive Technique for Brain's Intentions (2021)

HarnessMonkey – claude mods to show hidden tokens & improve vibes!

RTS a TypeScript-to-Native Compiler/Runtime in Rust (Cranelift JIT and AOT)

Show your hands honor for the power they bring you

Show HN: Inches to CM converter with charts and screen size references

Perchlorate

Show HN: How do you guys keep your journey diaries?

Drawbridge – Design Editor for Claude Code and Cursor

Spotify deletes 500K Malcolm Todd streams for suspected prediction manipulation