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?

California Cyberattack on 911 Systems

Show HN: Acquired Podcast Idea Dinner Returns

Japanese court overturns Red RAW video patent

Is Europe safer than America?

Ask HN: How do you set comp at an early stage startup?

The Anatomy of a Pass

Before We Click "Publish" on Hugging Face

Ask HN: What Project are you the most proud of?

Cloudflare OS

What do I want to be? – a poem about parenting in the AI age

I've Been to the Future. It Worked Out

Owner of original Intel 8080 pre-production Rubylith mask seeks restorer

Show HN: Discord-delete – Delete all your Discord messages from your data export

America's Military Is Dangerously Exposed

Show HN: A local-first, modular replacement for your accounting software

Optimizing a GPT-2-Class Transformer on a GPU

Iran Is Rewiring Its Proxy Network

Ancient Roman shipwreck discovered off Sicily coast

Linus Torvalds Explains What Makes Linux So Fast [video]

Beyond Prompt Injection: Hacking Apple's Private Cloud Compute

GitHub issues as long-term memory for coding agents

Bank statement PDF to CSV that runs in the browser

NOVC: Venture Capital Free

.NET on AWS Open Source Software Fund

2036

The Ambition Project

Modern JavaScript Tricks for Cleaner Everyday Code

A browser that generates every website from scratch

NASA chooses a once-abandoned Spanish village to broadcast the 2026 eclipse

QuiltOps – Continuous packaging for your patches