Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

GitHub Actions for Gradle v6: What's Changing and Why

TIL: Uv Settings I Changed after LiteLLM

Grade Caps Fail the Game Theory Exam

Building a computer from scratch and running C++ on it [video]

The US and Israel are making the Islamic republic stronger

Heerich.js – A tiny engine for 3D voxel scenes rendered to SVG

Understanding Semiconductors: A Technical Guide for Non-Technical People

Linux on Claude

Can AI Exit Vim?

Five Things to Know About the Siri Chatbot Coming in iOS 27

Calculate Dora Metrics for Free

Turing Complete

Meet The 'Corporate Bro' Making Millions Satirizing Tech Sales

Claude found zero days in Ghost and the Linux kernel

Rama matches CockroachDB's TPC-C performance at 40% less AWS cost

Sel – short film lauren flinner

Kee – Key combination matching on the modern web

Show HN: PeriodicTableOfElements.org

Social media is populist and polarising; AI may be the opposite

Show HN: Anamnesis – Open-source 4D strategic memory engine for AI agents

Pretext Demos

Alzheimer's disease mortality among taxi and ambulance drivers (2024)

pbix-mcp — create and modify Power BI PBIX files in pure Python

Translating non-trivial codebases with Claude

Catching crumbs from the table by Ted Chiang (2000) [pdf]

The Opt Out Project

BubbleWrap your dev env and agents

A simple explanation of the key idea behind TurboQuant

IN Event of Moon Disaster [pdf]

Anthropic's Mythos leak: 3k files in a public CMS, and what the docs revealed