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?

A Great Deal of Information About Hacker News

Show HN: Jolta – Automatic per-project JDK switching (like Volta, for Java)

Ukraine' Simple But Effective Protection Against Russian Starlink Jamming (2023)

Exercise Erased Half the Molecular Signature of Muscle Aging

Evaluation of a pentapropellant upper stage (1970) [pdf]

Show HN: Modelfac

Wine 11.14 – Run Windows Applications on Linux, BSD, Solaris and macOS

Show HN: git clone https://git.swerdlow.dev

Creative Focus

OpenAI did not notice Hugging Face hack for a week

The SharePoint zero-day panic this week is a marketing event

The computer has been surprising us

Claude used my pipeline to find a counterexample to the Jacobian conjecture

The final frontier – 01005 passives (2012)

The Shape of Apps

Bonsai – a toolkit for building AI chat apps with branchable conversations

In desperate need of money so im willing to make anything

Ask HN: How would I restore this 101 year old postcard?

Project Babylon: Gerald Bull's Downfall (2006)

Stripe closed my account with a 0.18% dispute rate

What Happened to WordPerfect? Why the Dominant Word Processor Disappeared

Show HN: Made a Free Shownotes Generator Website

Show HN: OneWayInterview – type a job role, AI builds the async video interview

LoRA Adapters Generated from Skill.MDs

Open Weights and American AI Leadership

BackSearch – Letting agents search the web

Cultural moderation of demographic differences in narcissism

Show HN: I rebuilt Microsoft Comic Chat's layout engine in one HTML file

Amazon cracks down on use of AI images by sellers after New York law

Ask HN: Multi dimensional sort (beyond Hilbert curve)