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?

Mid-Air Encounter: F-16 Rams Plane Near Mar-a-Lago [video]

The Sweet Spot: How One Brain and Micro-Adapters Could Save Open AI

Post-AI Computer Science

Thursday's $3T tech sell-off, and what it means if you build AI products

The Personal Stack

What the F**k Has AI Done?

Agentic era leads DB Services company to acquire another DB services company

Full-stack verification is the new trend

The Decline and Fall of Rigor in Advanced Placement

Bluefin Server

The Tech Bros Who Bet on Fascism Lost. Don't Let the Internet Pay for It

How two engineer side projects became the agent taking action inside Dropbox

Sniffing out the link between odor and disease

Republicans Learn X Is the Echo Chamber

The New York Times sues Brave web browser for AI scraping and bypassing paywalls

Brain-Scanning Hats Are a Privacy Nightmare

The Russian Contrabass Balalaika [video]

Michael Burry says Anthropic is 'betting its existence' on optimism

Gemini Omni 1.2 Flash now GA

Claude Now on Your Notch

Trying and Failing to Draw a Line Between Code and Art

Novartis confirms 9 reported cases of tumors in patients treated with Zolgensma

Mathematical Exploration and Discovery at Scale

Freedman's Paradox at Forty: A Practitioner's Guide to Variable Selection

VibeSys on Trainium: Agents Build/Tune Qwen3.8 Serving Engines on AWS Trainium2

The Surf Communities Selling Man-Made Waves to Homeowners

Bayesian Language Model Interpolation for Mobile Speech Input [pdf]

China Plans Broad AI Guardrails After Global Security Lapses

Confessions from Slopaholics Anonymous

Is There Football Now?