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?

Software for One

Opened the source of my game (multiplatform autobattler)

Americans Without Degrees Are Having One of the Best Job Markets in Years

Mirror Life Is Theoretical - The Danger Is Anything But

Ponytail: Lazy Senior Engineer Skill

Abliteration.ai is making a business out of removing AI guardrails

Always free and privacy-first image editor – PicFiddle

New method predicts where earthquakes will strike

Don't build your organization around a model provider

Everyone Has a Distaste for the Artificial

Speech2Speech – browser-based STT and TTS for interacting with local LLMs

Bespoke: A Programming Language for People Who Say Please – Larvitz Blog

Music Theory

Army to spend $465M on 'Group 3 killer' anti-drone laser

ROCm 10.0: A Decade of Open Compute, Built for the Age of Agentic AI

AI Is Already Making Us Less Human

GPT-6 Astra beats portal [video]

Airbnb cut authentication code by 60% with server-driven flows

Where Temporary Decisions Become Permanent Behavior

216M Spy TVs – The LG Smart TV Problem [video]

MathKernel: An evidence-aware multi-engine mathematics kernel and MCP server

Meditations on Moloch (2014)

The Death of Educational Content on YouTube [video]

Prediction of maternal and infant outcomes with a Mother-Child AI agent

LED Sports Ticker – A high-performance 60fps stadium-style scoreboard

Hard-Chat – A serverless, RAM-only P2P terminal chat

Five dead after Amazon-branded cargo plane overruns runway at Miami airport

App Review Shenanigans

Four Weeks of a Vegan Diet Alter Signs of Inflammation and Aging

CrisperWhisper – Speech to Text Model That Transcribes What You Say Verbatim