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?

Final run for the current LHC accelerator (but more to come)

Have politics come for the National Academies of Science?

Hacking Salesforce Sites with an LLM Agent

Why the US economy keeps defying the odds

Anthropic Is Taking AI Welfare Seriously. I'm Not Sure It Knows What It's Measu

I accidentally hit SOTA on agentic memory by using AI companions

Local Models in Mid-2026

Google's Pinpoint is the free research tool you should know about

Untrusted data in Linux – How Rust is going to save us

One-click, production-like ATProto network for local development and E2E testing

Levyer: The Platform. Designed for Freedom

HumanizeHub: A confidential marketplace for humanizing AI content

While Oracle Will Rake in Big Bucks on AI, Profits Are Hard to Predict

Upscaling Space Quest 3 [video]

Network service termination for certain Sony Electronics products

Sygnet – Hash any document with SHA3-512 and declare your AI usage level

Zuckerberg says Meta made 'mistakes' in AI workforce shift

Superpowers for Claude, Codex etc.

Nockchain vs. Pearl: The Great Compute War

A Rant about IPOs

Trial of 12mph bike lane speed limit grinds gears of Dutch cyclists

Cursed Knowledge

An architectural blueprint to excise MS-DOS device debt (CON, NUL) from Windows

New Brunswick woman sues OpenAI, alleging ChatGPT led to daughter's death

Don't trust large context windows

China Is Propping Up the World Economy by Importing Less Oil

Introduction to (Multimodal) LLM-as-a-Judge

Mining And refining: uranium and plutonium (2024)

How an astrophysicist uses Codex to help simulate black holes

AI: Surgeon's Assistant or Commodity on a Meter?