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?

User Inyerface – A worst-practice UI experiment

ChatGPT plan purchasing bug: Free to buy

Cory Doctorow on the High Cost of Living with the Ultra-Rich

Wawa VFX

The Match Act Is the Missing Piece in America's AI Export Control Strategy

Bipartisan Bill to Tighten Controls on Sensitive Chipmaking Equipment

37signals Dev – The ONCE app server

Show HN: Website that recommends outfit using weather and AI

The Season Finale of TBPN

Using AI to get better at algorithms

Three-Monitor Ridge Racer Machine Emulated in MAME

10 tips to increase your token consumption

Finland, Tesla, and the Quiet Revolution in How We Touch Electricity

Air Canada suspends 6 routes 'no longer economically feasible'

The Bhagavad Gita: Explained

Agents don't sleep, but your infra (and brain) might need to

The Commodification of Uncertainty

Show HN: DevToolBox – 88 client-side developer tools, no tracking, 9 languages

Opsec oopsie: Dutch Navy frigate location outed by mailed Bluetooth tracker

I made an interactive Fast and the Furious timeline/map

Trust as Constellation

Scientists invent new way to detect skin cancer (2024)

The world in which IPv6 was a good design

Self-hosted webmail client for JMAP protocol: Email, calendar, contacts, files

A PHP Dev Just Solved a 20 Year-Old KDE Plasma Bug

Chained Library

Show HN: Multi-agent task management for Claude and Gemini

Enumerations

ChatGPT vs. Gemini vs. Claude: The Best LLM Subscription You Should Buy

I made Claude Code at least 30% more efficient (for me anyway)