Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•9mo ago

Comments

nine_k•9mo 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•9mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•9mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•9mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•9mo 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•9mo 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•9mo 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•9mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

Pardoned Binance Founder Hobnobs with Trump Sons, at Mar-a-Lago Crypto Fest

Quod 64kb FPS and deep dive video

Stripe closed our account over upsell transaction architecture, not fraud

PEP 747 – Annotating Type Forms

Ring's Founder Knows You Hated That Super Bowl Ad

Ask HN: Why does it feel like qualifications are irrelevant to hirers?

Use digests, not tags, in your Dockerfiles

Show HN: Mercury CLI – CLI to Connect to Mercury Bank

HHS Releases 6 Years of Medicaid Claims Data ($1T)

Brewing possibilities: Using caffeine to edit gene expression

Optimism as Resilience and Resistance

Expanding our long-running agents research preview · Cursor

Piracy Is Only Illegal for You – Nvidia Sued for Alleged Theft in AI Training [video]

GitLab Threat Intelligence Team Reveals North Korean Tradecraft

A $10K+ bounty is waiting for anyone who can unplug Ring doorbells from Amazon

Flickr's URLs Scheme

AI Agent Harness for ClickHouse

Show HN: Year era of WP might be over

This doctor is training AI to do her job. And it's a booming business

A Love Letter to Public Libraries (2024)

We cut Node.js' Memory in half

Trump vows $10B from U.S. for his Board of Peace

Resurrecting _why's Dream

AI Skills Platform (Stealth) – Technical Co-Founder – Remote (US) – Equity

Programs you need to know about as a Linux user

San Francisco's next crazy idea: Civil rights for AI

Extreme heat increases strength of pure metals

Lindenmayer Systems

Restructure pricing from subscription tiers to credit-based model

Show HN: Devly A native, private macOS utility belt for developers