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?

Post Quantum Liveness, Identity, Provenance. No Biometric Identification

1

Why Are Many GitHub Issues Nonsensical for Visual Studio Code Edge Dev Tools?

Spared execution eight times, oldest inmate in US dies at 101

How Big Tech's A.I. Borrowing Binge Is Driving Up Bond Yields

Turning on airplane mode was never about keeping the plane in the air

Show HN: Getfkd – adults-only dating (swipe, match, meet tonight)

Sing-song: a speakable encoding for long numbers and keys

Founder sues YC over idea in rejected 2018 application

We replaced our 223-node agent graph with a single open-source LLM

Show HN: AI tools with real pricing, submitted in 30 seconds

Cryptomator

Ozone: The Fault Is Not in Our Trees, but in Ourselves

New visualizer: U.S. state obesity trends

You Are Not Fat Enough for Retatrutide

AI #182: Pause for Reflection

We Taught Sqlc to Invalidate Our Caches

Moon→Leo Transfer Sims for a Lunar Mass Driver, Terrain Analysis, Power Sizing

BTP v2.2 – An open, offline cryptographic trust protocol for AI agents

Show HN: PNGine, Declarative WebGPU in S-expressions that match the spec 1:1

Data Science Weekly – Issue 665

Canadian premier says Trump is a 'bad person' as Canada weighs concessions

OpenCyvis: An open-source AI phone agent that runs your own LLM

Zalgo: The Good, the Bad, and the Ugly

LastSpot: A 100-product leaderboard where bids decay 5% daily

TFreax, a new 3k shootem up game for the Vic20, c64, Atari 400, etc. Open source

Intelligent AI Delegation

Exploring the Far Side of the Moon: A Visual History

Detecting scraper bots through scroll behaviour

US power grid at risk of 18-month blackout; 1 city now in dark for over a week