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?

Swedish parliament abolishes permanent residence visas for migrants

When Did White-Collar Work Start to Look So Bleak?

Andy McLean: Rapidus MoU Boosts U.K. Access to 2-Nm Tech- EE Times

Meta Employees Hate Zuckerberg's Plan for a Companywide AI Hackathon

Ask HN: Why did you open source your project?

Micro Radar: a tiny open-source flight radar for your desk

You Can't Have Both Democracy and Billionaires

Justice Department Decision to Allow Paramount Deal Surprised Investigators

Qualcomm in Talks to Purchase Tenstorrent

Openfootmanager: Open-source football management simulation game

Show HN: AltiVerse: What If SIM, see different decisions affect an environment

SMTP Relay with Web Dashboard

Satellite Tracker 3D

San Francisco Weighs PG&E Takeover Amid Soaring Utility Costs

Show HN: Phlox – Open-source self-hosted agentic web chat

Show HN: A Framework with a Possible Application to Hybrid Cryptography

AWS WAF now lets content owners charge AI bots for access

Why I Email Complete Strangers

Show HN: Simple, lightweight, modern, turnkey, Java web server library

Pinboard.in is not resolving DNS

The Backdoors Inside Smart Devices WSJ [video]

Show HN: When Will AI? – A timeline of top AI predictions

What if it all came out?

Passing Cloudflare Turnstile using two fingers

DPBench: Structural Determinants of Multi-Agent LLM Coordination

Fedora 44 Gnome review – We're not in Kansas anymore

The Most Recognized English Word

Show HN: Get your first set of users by supporting others

Node-Red 5 Released

90s Kid – Nineties Nostalgia