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?

Decimen Optical Transfer: fountain-coded QR file transfer

The Automation Mindset: Why AI Rewards Builders and Sidelines Everyone Else

What Every Programmer Should Know About Twists of Elliptic Curves

US cites 'unauthorized travel' to end DACA status for mother deported to Mexico

Economist Style Plugins for Claude Code

Judge Voices Doubt US Has Justified Its Ban on Anthropic AI

Cursor Benchmark Partners

Show HN: A VS Code extension buffers NPM updates to avoid supply chain attacks

Anthropic AI Models Hacked Three Organizations During Tests

Show HN: Great Spectations, the Spec Checker

NeuronAI turns smart solutions into voice

We accidentally built an LLVM compiler for Jax

ISS Mimic

The Religion of Speed

Premier league bans gambling sponsors

Save and restore may be coming to GNOME

Show HN: Play SNES, gba, in your terminal, even in tmux

Specula: Scaling formal specs for autonomous model checking of system code

Memory-level parallelism: AMD is the king

LLVM AI Tool Use Policy

Inkling Small is the highest-scoring open-weight model evaluated by ARC Prize

Hugging Face Incident Initial Post-Mortem

Gemini Robotics

DeepSeek Founder Liang Wenfeng in His Own Words

WTF per Minute – An Actual Measurement for Code Quality

NVIDIA-labs OO Agents: Native Python Object-Oriented Agents

Anthropic AI Models Hacked Three Companies During Tests

The AI Aesthetic

The Absurdity of Albert Camus

Cross-Vendor Semantic Void Matrix: Zero-Byte Outputs in GPT/Claude/Gemini/Kimi