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?

Ukraine hits Moscow refinery again

Show HN: Automatically Validate Python Packages

Maslul – Smart LLM router – one call, the right model

I Hate Compilers

Introducing Vercel Connect

The Teachers Getting $50k Bonuses Thanks to a Meta Data Center

Cursor and SpaceX: In search of a complete loop

SF landlord killed tenant to clear Sunset home for sale, lawsuit alleges

Ask HN: I miss Fable, anyone else does?

Amazon S3 Annotations

Ask HN: What's a prompt you've written that you're genuinely proud of?

Show HN: Attagram, a tiny printer that gives kids a magical daily digest

Eve from Vercel

Bet on Centaurs

The Leading Deepfake Expert No Longer Trusts His Own Eyes

Sigil – tamper-evident audit and signed scopes for LLM prompts

GitSwitcher – a macOS menu bar app for switching Git identities

Vulnerability Disclosure: Stealing Emails via Firefox's AI Features

Show HN: I built a tool which turns any website into promo video in minutes

An event-driven AI pipeline using FastAPI, Redpanda, and Docker

Cervical cancer mortality trends following HPV vaccination in England, 2001–24

BBC to axe Radio 4's The World Tonight after more than 50 years

YaFF – High-performance C++ serialization library

The Next Computing Revolution May Come from Stacking Chips Like Skyscrapers

'Most famous tree in the world': Sherwood Forest's 1000-year-old Major oak dies

GLM-5.2 is probably the most powerful text-only open weights LLM

Simpler, older version of Stonehenge found three miles from famous site

Interesting Google AI Results

SteamOS Linux 3.8 released as stable

Privacy-Preserving Age Verification–and Its Limitations [pdf]