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 USSR in 100 Photographs

Qector-Decoder-v3: Multi-Back End Software Architecture for QEC

Japanese Police Arrest NYAA 'First Uploader,' but Not by Watching the Swarm

A Chinese AI model stopped OpenAI's 'unprecedented' cyber attack

Happy 808 day: The TR-808 Monograph

Cloudflare launches Kitesurf, a browser built for AI agents

1.59X speedup on SQLite 3 in 8 hrs with $150 API cost

I made a memory chip price tracker in five minutes

Amiko: A desperate virtue signalling attempt

How a liquid rocket engine is built, animated as a factory

Three.js gets native support for Gaussian Splatting

Safety fears as scientists make first viruses designed by AI

China is gaining ground in AI. But the U.S. still has a major advantage

Why AI has brought nothing more than the conceit of wisdom

Remembering the pre-Google web, when search was an experiment

The Diamond-Square Algorithm

Show HN: Otaku – A Roleplay Terminal Client

A passing star: our Sun's near miss

Auto Mode will be the default in Claude Code – because humans can't be trusted

Modern Terminal File Manager

Google's Westinghouse Bet

The world is full of marble. Most of it is fake [video]

I couldn't have put it better myself (2016)

Show HN: Compactdiff – see what compaction dropped from an agent session

Show HN: Mail Attachment Lens: A Browser extension to manage Gmail attachments

Keeping yesterday's computers ticking takes more than nostalgia

Ask HN: If you don't read books, what do you read?

'I hate what AI is doing to the minds and happiness of the young'

Show HN: Keynou Drive – Branded URL Shortener for SaaS

I built AI at Amazon, then got laid off