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?

Hackers Use Chinese AI Tool to Hit South Korean Banks

Anthropic Startup "Program"

A Framework to Benchmark Different Placement Algorithms in a Distributed System

AI Film 'Gods Don't Give Gifts' First Trailer for Dec Run, Plans Oscar Bid

Microsoft, Ericsson lead global tech alliance for digital trust

Show HN: 800M AI harness to beat 7B [video]

My unsupported Kindle runs Linux now, and it's more useful than when it was new

Human Friction Makes Agentic AI Safer and Smarter

Tell HN: Apple not letting removal of AI models on macOS 27 is outrageous

The Federation Fallacy (2019)

Show HN: I had 100 tabs open, so I built Daysift with AI powered by Proton

A few vectors for a mixed folder (pooled directory embeddings)

A brief history of clinical xenotransplantation

The Model Isn't Cooperating

Show HN: InBrief – open-source AI news aggregator with LLM filtering

The Best of Om Malik

How the Courts Became a Safe Haven for Corporations

Show HN: Clawock – AI argues, code settles the trades

Cloudflare has "major" outage for 48 hours now

Show HN: I made a TV for old cartoons

Piratefly – Free flight deal finder: the cheapest fares from your city, fare

Device detection and occupancy monitoring for Airbnb hosts

Stop Asking Whether AI Wrote It

AI poker coaches, identify leaks, improves decisions

SynthID Detector

Trend Switcher Bot (MIT)

Rainmakers: The drones used to seed clouds

Creating Fake People Is a Terrible Idea

Record Field of Qualifiers Accepted to Boston Marathon

AI Papers of the Week MCP Tools