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?

Hildegard of Bingen The 12th-century mystic who saw the Earth as a living whole

US proposes $100k charge for international students to do post-graduate work

I Pointed AI at 400 Years of Archives. It Found a Forgotten Meteorites and More

HarnessTax: How Much Does the Harness Matter for Coding Agents?

Comparing Chromium Development at Google and Igalia

Show HN: 10M synthetic corporate emails and calendar files in 29 languages

2nd Yandex Cloud Data Center Was Attacked

Show HN: Pigeon – email API for the mail your app sends

Plumbers, chains, and famous painters: The history of the pipe operator in R

Michelangelus, the Story of the Font – Microsoft

Ask HN: How do you turn videos into searchable text without uploading them?

Notes on how glibc and musl handle math errors

A US charity plans to use AI to monitor its Gaza schools

Maybe humans are just bad at math

ChatGPT work is down: Could not resolve host: github.com

Ask HN: Difference Between Astro and Next.js?

Show HN: All Things Banana – banana news, prices, and a daily Wikipedia game

You can now run Googlebook OS on your Mac, unofficially of course

Ask HN: What was the last task about that you abandoned

I Use AI to Learn Things [video]

Show HN: I let Claude refactor my old game

Let your AI agents paint big arrows, boxes and text on your screen

We're putting too much faith in AI's ability to say no

Show HN: Client-side image cropping for any file input, without coding

Show HN: Gh-reponark – audit settings across every repo in a GitHub org

Pure ARM64 assembly implementation of the ED homophonic codebook cipher

An Open Letter to Scott Alexander

AI Assistants Transform Nuclear Power Plant Work

Windows Media Player skin museum

A GTA-like vibe coding game that's currently taking Taiwan by storm