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?

Supply and Demand Is Not What Most People Think

Strategic Petroleum Reserve

Show HN: Aurora – AI Gateway built in Go

What a Growing Telegram Disinformation Network Reveals About the DSA

Show HN: TUFHub – Autosync TakeUForward DSA Solutions to GitHub Accepted Verdict

A low-latency sandbox for untrusted Python execution

Don't stop early: Case-folding source code at memory speed

Open-Source AI Platform Orbit

The hallmarks of protein and amino acid restriction in aging and longevity

GhostMetadata – strip EXIF/GPS data from images locally, runs on mobile term

The Anarchist Agent of Artificial Intelligence

The case for a lunar biocontainment facility

Legendary Mountaineer Nirmal Purja Killed in Broad Peak Avalanche in Pakistan

Show HN: Wienerdog – memory and self-improving skills for Claude Code/Codex

Software architecture has its own desire paths

Science is dying in the UK (short) [video]

Libration

Keeping FairScan simple isn't simple

Reducing protein intake could support healthy aging by reshaping metabolism

Rust – What .boxed() costs you (and a tiny crate to avoid it)

How the smartest people use AI

Deployments are now up to 7 seconds faster

Toasts pose significant accessibility concerns and are not recommended for use

How to Spot AI Writing

Christopher Nolan's Collapsing Worlds

DeepSeek's Plan for AGI Is the Costco Hot Dog

Show HN: Reimagine place photos with Nano Banana

Wyro – Draw a backend on a canvas, export TypeScript with no lock-in

$350 for a single slice of pie?

Two 500-year-old mummies confirm Europeans brought smallpox to the Americas