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: WebhookVault – self-hosted webhook infrastructure with RBAC and replay

Reddit mod used AI to hack Star Wars Galaxies emulator over a 14-year-old grudge

"Zlibrary my beloved": Anthropic staff chats extolling piracy cited in Sony suit

Vitela. A free, type-safe alternative to Overleaf

DeepSeek v4 Flash Vision Exp is now open-weight

The Domain Software Engineer

PDE Role Explorer

Merit, Hire engineers based on simulated work

Show HN: Kiso – Publish one OKF knowledge base for humans and AI agents

Global Trade and the US Navy

Autoscaling Lakebase Postgres

A Selection of Los Alamos Rolodex Business Cards

OpenAI and Anthropic are ruining San Francisco

What It Took to Dismantle the Most Powerful Company in the World

Things I Won't Work With: Straight Dimethyl Zinc

Should your Claude Code sessions cache for five minutes, or an hour?

Ask HN: Why does Hacker News use the obsolete HMAC?

Broadcom pledges to lock down open source Python and Java libraries

Embedded Swift Improvements Coming in Swift 6.4

Perceptron AI releases Isaac 0.5: 36B, open weight, embodied foundation model

Inside the hunt for suspected Chinese drone spies over US military bases

Omarchy Quattro is the #3 Linux distro by active 1Password users

YouTube blogger Markiplier becomes GoPro's largest shareholder with 8.5% stake

When Japan Tried to Create Artificial Intelligence in the 1980s

Cloudflare Unveils Adaptive Intelligence to Counter AI-Fueled Bot Attacks

Microsoft 365 Is Down

SDL's Agents.md

A '70s Improv Book Became Silicon Valley's Required Reading

Fish Bad, Sugar Good and Other Medieval Ideas About Food

Mobile Is One of MOQ's Video Streaming Biggest Opportunities