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?

Nvidia DLSS 5: Modders enable AI faces in all sorts of games

Zenresume

Infinite Slop (24/7 AI video generation)

Show HN: Albums Vault, my take on how to manage Spotify album library

Free Image Upscale

Open Source tool to detect software supply chain attacks

I Didn't Set a Cookie

Reckless Ben confronted Ideal Living's CEO over trafficking claims

Fifty Shades of Klinker: The Bricks That Shaped Hamburg

Show HN: FlarePeek – a chrome extension for Cloudflare Worker developers

The Aphantasia Lie [video]

In less than a year, Google made scraping 10× harder

Droptick – one ad slot per week, the price only falls

A 12TB Steam "teraleak" spills more than a decade of lost PC gaming history

How AI Agents Make Discord Support Faster with SeaTicket

One Plugin, One Config, One Starter = All-in-One Kit for 11ty / Build Awesome

Drug test policy search site

Infragrid: Turn screen recordings into agent workflows

Forbidden planet: was Pluto's 2006 demotion a big mistake?

uv: Deduplicate all files in the wheel cache

The museum charting how humans understand the world

JerrySniffs to shut down permanently on September 5th

A Modest Proposal for Anthropic

Reddie – Autonomous AI Red-Teaming and GitHub PR Patching DevTool

But where does taste come from?

Scaling Memory Safety: AI-Assisted Rewrites of C/C++ Dependencies to Rust

Xkcd 1200: Authorization

Europe's largest collection of historic adverts

The U.S. is more than just the US (according to the ISO)

Firefox's password "security" is mind-numbingly stupid