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?

AI automation startup Relay shuts down, staff joins Google's Chrome team

AI Watermarking, Nazi Enigmas, and Sherlock Holmes

Return of the Spec: Why AI agents are reviving the software specification

No Cloud Required: Talking Directly to My SunPower Hardware

A Texas University Becomes a Petri Dish for a Conservative Overhaul [Using AI]

Inference Costs per Agentic Workflow to Increase More Than Fivefold Through 2028

Contributors are AI-first now. Is your project?

Show HN: A Replacement for Shortcutfoo

Webhooks Suck: Fixing the Problems with Consuming Webhooks

Has vacuum birefringence been seen at long last?

The market for used EVs 'is so hot'

My Extension Got Viral

The SEC is no longer independent

Maximilian Schwarzmüller – "Don't ignore the new stuff" [video]

New Nightmare Eclipse zero day gives system privileges on patched Windows

Show HN: Echidra – open-source deception platform for attacker behavior

IP can't save you from AI

Measles Used to Be in Our Rearview Mirror. Now Cases Are Reaching Record Highs

Garmin watch app as a pure Bluetooth Tesla car key

Scientific applications of quantum computing: challenges and opportunities

The MATRIX – 1950's Super Panavision 70 [video]

Columbia House, Mail-Order Media Company, Is Shuttering

Looking for Cofounder in Legaltech

Star Wars: A New Hope – A Visual Guide to Changes in the Disney+ 4K Version

Why the IBM PCjr Failed: The "Peanut" Disaster Stan Veit Ch. 24 [video]

Cursor: Chat is all you need

Ideating Tragit

macOS Data Protection Keychain for Electron Apps

Data centers raise nearby temperatures by up to 4 degrees in Phoenix

AI chip startup Etched doubles valuation to $21B in under a month