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?

Hello

Shellport: An SSH terminal, file browser and live server dashboard

My AI Agents Found an Unmapped Maya Site

An AI agent said the code was verified. The evidence said otherwise

Satori – Offline Android voice notes with on-device STT and local LLMs

Ask HN: How do you care about a project that is predominately generated by AI?

The Parents Suing Schools Because Their Kids Got Bad Grades

Now We Act – Timothy Snyder [playlist]

Fighter Radomes Explained: Why noses pass radar

Six Math Essentials by Terence Tao

Apple is working on a new app called Harbor

Jefferies Accused of Betrayal by Client of Its Leucadia Fund

New Phase 3 Parkinson's drug candidate

'Flying cars' could launch in China next summer, maker of two-seat model says

Sherman Anti-Trust Act (1890

Solving Impossible Problems for Fun and Profit [video]

In open-weight AI, America is the one playing catch-up

What Is Agent Experience (Ax)?

Tim O'Reilly – The New Knowledge Artifacts of the AI Economy

Show HN: Sprites. A calm, streak free habit tracker

Turn a photo of a pile of Lego blocks to a build with Claude

Geohashing.site's Better Banhammer

Neurons as an Interpretable Basis

Technical Debt Can Derail Coding Agents Through "Agent Distraction"

Strike for a Different Spain

Debunking Litellm Rust Benchmarking

Alpine Linux and OpenSSH patch flaw that's as bad as it can get

Social Policy Builds Financial Markets

Show HN: Cloakroom – Keeps secrets away from agents

Dungeon Crawler's Lookbook: Visualize character progression, built on dbt Charts