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?

Meowzip: Cat Logic Puzzle

The Death of the Author

No Apple Pay, No Sale

Airbus bows to remote working demands after series of strikes

Show HN: Froging AI – image and video models in one workflow

Daimon – Local Privacy LLM

Ask HN: Will AI trigger mass IP protectionism in software?

Procedural Grid Art

Show HN: World Sizer – A world map where area reflects population, GDP, and more

Chinese Gov issue warning: Don´t talk to aliens if you see one [video]

Show HN: Ringdl2 – A lightweight Linux downloader in Rust using io_uring

The Web-Search Latency Your Agent Pays

Japan's music cafés are striking a chord abroad

Ask HN: Guess what makes SSH multiplexing physically impossible

Ask HN: Any opinions on Muse Code over others?

A Tale of Two Flink Autoscalers

Malware infects Android-based automotive head unit firmware

Things a Computer Scientist Rarely Talks About, by Donald E. Knuth

Yomif Kejelcha regains world half marathon record with 56:51 in Buenos Aires

Go Ahead, Sean Duffy. Let Your Daughter Go to Harvard

Show HN: Rmp, a Subsonic music player for generating playlists on the fly

AwardMath – Award Travel Planner

Soofi S 31.6B. German Open Moe Explained

Vibedecode

There is now over 2,100 hours of video evidence on Archive Genocide

Ask HN: Is Apple Messages plugin for ChatGPT a privacy risk?

Ask HN: What a fullstack dev should know about security?

All Your Heroes Were on Drugs

The rise and fall of rationality in language (2021)

Show HN: Ever Wanted to Call Codex from Claude Code? My Harness Orchestrator