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?

The government is recruiting tech companies to help fight its cyber battles

Rodeo, a terminal file manager inspired by Norton/Midnight Commander (Rust)

Leveraging Requirements Engineering for AI Coding Tool Success

The Harness Is the Bottleneck

I built a lint for AI-generated evidence

Silver Lake in talks to buy Workday, sources say

SilkCode – Tired of resets/limits with Claude but better than Codex

Yaak.ai Physical AI OS: copper-rs

Caterpillar Technical English agent skill

TikTok finfluencers: How reliable is their financial advice to young investors?

Building a Minecraft Computer Taught Me More About CPUs Than University Did

Northwest Indiana residents dealing with 'largest outage event on record'

The Making of Cursor's Icons

Airbnb Eval-driven development: Lessons from evaluating GenAI at scale

My app for Shipaton 2026: Two Weeks In

How Organizations Use AI: Evidence from ChatGPT [pdf]

Romania shuts only nuclear plant as heat causes drop in Danube River level

CheeseChain

Namecheap has been down for six hours

µ-Boosting Your CMake Productivity with Environment Variables

Ask HN: How much money do you spend monthly on subscriptions for AI models?

Swinth – By Sung J. Woo

Jeff Dean: The 1% Rule for Building in AI [video]

The Buzzword-Driven Development Manifesto (AI Edition)

Perseids Meteor Shower

Reviewing the evidence on worker retraining programs

Thoughts on "SIMD in Pure Python" – purplesyringa's blog

Innovations of SolidJS 2

Iluvatar – classifies an app idea into CS terms before any tech gets named

Python Type System and Tooling Survey 2026