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?

I tested the viral "antigravity drive" claims against published physics

Chat Wells, an Internet Masquerade

Emacs 31.1 RC1 is available

Poll showing Bass leading Raman by double digits was bogus "social experiment"

Weird Machines in Transport Layer Security

What If I Told You Humans Are Moving Faster Than AI?

Why It Hasn't Happened Yet: Capable AI and Malicious Intent

Niu Lai – a two-person animated film becomes an unlikely hit in China [video]

Expert Witness to ChatGPT "Show how 3M is 0 percent at fault"

Using Starlink's Satellites to Study Earth's Upper Atmosphere

When it comes to LLM, it's you who's using it wrong

San Diego 150 Years Ago: Rare AI Reconstruction Visuals [video]

PineNote and PineTab2 are estimated to run out of stock in three months

Beyond WASI: Running any Rust application in the browser with BrowserPod 3.0

The Large Hadron Collider: 1984 – 2017

Missed shifts were costly to this McDonald's. An app has fixed the problem

Sick of A.I. Slop? So Are Tech Giants

Show HN: An open source alternative to Google's Critique

USS Benfold Stalled and Lost Power in the South China Sea for Four Days

Columbia House Is Shutting Down

Fires on the Plain: Both Ends Burning (2007)

Show HN: An n8n-like orchestration toolkit for DeepSeek harnesses

Creepy Insurers?

I built an app that hides encrypted messages inside normal emojis

California's new tire efficiency rules could save drivers $1B a year

25 Years of Haiku: From "Ok, Let's Start" to the Present

Google plans to stop making Pixel products in China in 2027

Help Peer

Show HN: Honeymatcha.io connect your Grok bots for dating, meetups, anything

Show HN: Build beautiful web apps faster with UiSvelte