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?

There are things with ranks, but it's not always clear what the ranks mean

Why AI Will Not End Scholarly Publishing (and the Publish-or-Perish Institution)

Hiding prompt injections in PDFs, and six judges that catch them

Free OKR Spreadsheet Template for Google Sheets and Excel

Show HN: I built a free trivia hosting app with no accounts or subscriptions

A Portrait of the Luddite as a Young Man

Vasomechanic treatment associated with increased efflux of human brain proteins

Day AI: Context Graph and Agent Control Plane for GTM

The Microcontroller Inside a LoRa Chip

York teenager invents device to stop rats damaging railway

We're bringing back the HN meeting in Mexico City

Sama Wants You to Have More RAM, Not Less, Changes Name to "RAM Altman"

Show HN: Spiral Nest – an ant colony simulation inside a bubble chamber

From the server to SQLite to reactive Svelte state

Flash C – Open-source C Compiler and (Turbo-C like) IDE for Linux x86-64

A bash script that emails Sam Altman once a day to report the RAM he missed

Some thoughts on AI, scientific papers, and peer review

NASA accepting astronaut applications until December 3

Learn C++ Before You Learn What It Costs You

Retro Bowl

How we built Render OIDC

Tell HN: HN Is Wrong

Show HN: Agent Manager – keyboard-first workflow for running many coding agents

Drawably creates animated, hand-drawn UI controls with randomized sketches

Webframe runs web pages as CLI programs using a hidden system web view

The Death of the Natural Soundscape

Fixing IDN hostname validation in a Java JSON Schema library (IDNA2003 → 2008)

Trace-engine-CLI: analyse DevTools traces with agents

We got tired of paying for CAD, so we built our own [video]

reveal.js: a slick, JavaScript-based, FOSS presentation framework