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?

Stock Market Crash

What GDP Means in a Soft Budget Economy Like China

A brief history of single-session agents

The DevRel Ambassador Pattern [video]

Knit – Messaging Without the Network

The Last Human Job: The Work of Connecting in a Disconnected World

Show HN: Trademark Screen – free plain-English trademark check with email watch

Show HN: SrcWranglr

Show HN: Resource Manager – Manage all resources on the computer

Podcasts near you, via the Podcasting 2.0 <podcast:location> RSS tag

Show HN: Zenith, a developer platform for shipping and selling your app

Editing at the Speed of Thought in Emacs

Epileptic seizures nearly vanish after people receive experimental gene therapy

The Beginner's Guide to AI Governance

How the Phone Book Taught America to Ask for Answers

On-call has a new job description

Realbotix Series 1 Humanoids

Show HN: Kids Shelf, your kids' own little internet

Exporting tables from a SQL Server backup (.bak) to Parquet without restoring it

Tuist Runners are finally here: managed macOS and Linux CI

An updated Model Spec for more capable and beneficial AI

GitLab patched the CVE. Your leaked token is still valid

Your Cryptography Conspiracy Theory Is Wrong

French blood storage impacted by freezer hacks

NASA Announces X-70 Experimental Aircraft to Advance Flight Research

RIP Good Times

Scittle: Execute Clojure directly from browser script tags via SCI

PsychonautWiki – A psychoactive substance and harm reduction encyclopedia

Offline survival assistant – local LLM and Kiwix, runs from a USB stick

Clordle: Wordle, but every answer is a Clojure function