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?

The bottleneck isn't writing code anymore. It's understanding it

Does 40 Hz gamma stimulation work and what it does to the brain

Tampermonkey: Enhance the functionality of your favorite web pages

GDP and prosperity across technology paths

MetroCard Vending Machine and MetroCard Express Machine Auction

ARC-AGI-3: A New Challenge for Frontier Agentic Intelligence

Closing the Hardware Gap: What QEMU 11.1 Brings to Arm Developers

JEP draft: Windows/GCC Port

Designing a Query System

Leadership Lessons from the Odyssey

The Simple Elegance of the Integrated Timing Belt Loopback Fastener

Should AI labs be treated like the owners of dangerous animals?

Typora theme for long-form Chinese – token-built, 0 important

GitHub Star History, Revived

Factoring Your Code

Ask HN: How do you do PR reviews now?

Tucker Carlson unveils 10-point manifesto amid third-party speculation

Show HN: Solsticio – daily sun/moon logic puzzle with a deterministic generator

My Precious Attention

The Agent Access Model – The Cloudflare Blog

Humans missed 1 in 3 threats approving AI agent commands across 40k game runs

PR-desc – generate PR descriptions from a Git diff, no AI required

Atlantic hurricane season looking like a dud, but there will be a price

Show HN: I made GifJot to turn part of my screen into a GIF I can paste

Show HN: OpenThat.Link – Trigger a webhook, open a link in your browser

Run coding agents with local models

Streaming QR codes at 60 FPS

Show HN: Jolt a decentralised content syndication network

The Labor Market Impacts of GLP-1s

GitHub – AI book writing tools (curated list)