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: W-ISA – An instruction set for programming LLM weights

Huawei says it's made a 100 percent Chinese PC

Nvidia reportedly preparing to fire CEO Jensen Huang, amid of second affair

Shruti Rajagopalan: The Political Economy of Gulliver's Travels

Tyler Cowen: Jensen Huang's Is Out. Who's Next?

Passing of Richard A. Posner, Senior Lecturer, Law and Economics Pioneer

Get ready for fewer Opus 5.5 em-dashes

Hands on with Home Assistant's new 'smart home multi-tool'

IFR tool for pilots to know if we should expect a delayed departure window

A cross-platform app available on Web and Play Store

Agentic AI for Military Cyberoperations (West Point Press) [pdf]

Show HN: Fortnite Chest Counter – track every chest, loot odds, no login

In-depth Analysis of DPRK Contagious Interview campaign

Composing data pipelines in an AI-native workflow

Fable 5.2 or Opus? When to use each model in Claude Code [video]

New tests compare browser fingerprintability

The Governance Challenge of the Energy Transition

NY is forcing T-Mobile to stop putting data caps on low-income home internet

Procopticon – A process manager for macOS for power users

Modern Web Guidance 1.0: The web platform expertise your coding agent is missing

The Nvidia Way Jensen Huang and the Making of a Tech Giant

Show HN: Dogfood Bench

Nvidia is reportedly preparing to fire Jensen Huang

Richard Feynman: Can Machines Think? [video]

Show HN: Agent skill and Claude/Codex plugins for Google Ads campaigns

Show HN: SilentStars – Lesser-known open-source projects still being built

Claude usage in your menu bar

Sift: LSP, Lint, Format Lisp, Scheme and Emacs Lisp

Rendering in Batches with Glimmer and Datastar

I Accidentally Became a Millionaire