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?

Why LLMs Are Unreliable Language Detectors

John Berger: From Life by Tom Overton review – a vibrant biography

Designing least-privilege registry credentials for CI

22 Years on Firefox, and Today I'm All In

Show HN: Diamonds – Dots and Boxes, but with diagonals and area scoring

An American Mosaic (interactive map of ancestry census data)

Fastest Inference in MENA

Randomly Generated 'Peer Reviewed' Papers Published by Springer Nature

Plasmonics

Show HN: Interactive TSP solver with step-by-step algorithm explanation

How to Plan? (2022)

Nixpkgs-Multiverse: Fast Mode

Ask HN: What tools are you using for human code review of AI-assisted code?

Show HN: Rungraph – See your AI coding-agent runs as a graph

When Astronomy Morphs into Astrology

Let's Be Honest: Tokens Are Replacing Payrolls

Weather apps are crushing America's small businesses

NIH is ending a key grant for budding clinical researchers

I Made a Plex Server

Show HN: ViaNJ – an app that makes NJ Transit ticketing less painful

Trump administration wants to allow companies to hack foreign cybercriminals

Glider: Drive all your agent CLIs from one terminal

Being Ambitious and Being a Dad

Who Tells You Whether the Molecule Your AI Just Designed Is Any Good?

Writing 300k+ lines of code per month is the new normal, I guess

Rogue AI aren't science fiction anymore

The experience of mathematical beauty and its neural correlates (2014)

I tested every Al model the same way. Only one task got better

OLED Burn-In Hasn't Improved Like We Expected

Lichen – simplest CMS for the web, based on Forth