Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•9mo ago

Comments

nine_k•9mo 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•9mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•9mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•9mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•9mo 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•9mo 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•9mo 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•9mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

A Defector Explains the Remote-Work Scam Helping North Korea Pay for Nukes

Top non-ad google result for "polymarket" in Australia is a crypto scam

Show HN: I gave my AI agent $50 and let it trade on Kalshi

The heavy reality of Venezuela's oil

Minnesota Bathrobe Lady Sam Stroozas of MPR News

We are in the "gentleman scientist" era of AI research

I got tired of babysitting Claude,so I built AI agent that run on my laptop 24/7

Terry Tao – Machine assistance and the future of research mathematics [video]

Your pet's microchip may now be useless after chip company goes out of business

The great software stock meltdown

Intermittent fasting no better than dieting, study finds

Is there a true alternative to Discord?

Intermittent fasting no better than typical weight loss diets, study finds

Developers, Factory Workers, and the AI Replacement Myth

The Origins of One of the Most Beloved Video Games of All Time

Contra "Grandmaster-Level Chess Without Search"

Personal Business

DHS pushes social media giants to dox anonymous accounts critical of ICE

A Love Letter to Plastic Junk: Nintendo's Weirdest Inventions

Standard Notes – End-to-End Encrypted Notes App from Proton

The Rediscovery of 103 Hokusai Lost Sketches (2021)

Show HN: Katipo is a minimal alternative internet with a Vulkan based browser

Palo Alto Networks Expands Identity Security with CyberArk Deal and TASE Listing

India's pollution is becoming an economic roadblock

Show HN: OpenSlimedit – Cut AI coding token usage by 21-45% with zero config

Why do I not use "AI" at OSNews?

Show HN: Image to Photo

A NEW Windows‑native SSH agent

EPA ends credits for automatic start-stop vehicle ignition

ASUKA.md – The SOUL.md for Eva Asuka