Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•10mo ago

Comments

nine_k•10mo 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•10mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•10mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•10mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•10mo 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•10mo 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•10mo 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•10mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Show HN: Unblurry – Your memory lies about how you work

macOS Tahoe windows have different corner radiuses

Show HN: Notation – Real-time AI clinical notes for physical therapists

Show HN: AlifZetta – AI Operating System That Runs LLMs Without GPUs

Show HN: Mirra – AI turns ideas into social media carousels and videos

Google Just Made Your Reports Watchable. and Video Editors Are Worried

Free Ways to Find Someone's Email Address

Microplastics and nanoplastics in urban air originate mainly from tire abrasion

FlowLessAI – connects to GitHub, audits your codebase, delivers a PR with fixes

Qwen3-ASR-Swift

X Accounts with over 1M Followers

Can the Most Abstract Math Make the World a Better Place?

Show HN: Compare ORMs Side-by-Side

Delta – 3D racing game for MSX2 (z80)

Summer Academy for Intercultural Dialogue 2026

Trojan Source: Invisible Vulnerabilities

RemixAI – All-in-One AI Platform to Generate Images, Videos and Creative Effects

Insightful Pipe

Why every demo account is named John DOE (a 700-year-old reason)

The One Question That Exposes Fake Product-Market Fit

Open YouTube links directly in the app, skip the browser

The US military is still using Claude – but defense-tech clients are fleeing

Child's Play

RasS (Rounding-as-a-Service)

Federated Systems Dissapear

Show HN: I Built Glassdoor but for Food Delivery Drivers in Dubai

Vivo Time: stop wasting time, start living it

Nokian Tyres launches studded winter tire that adapts to changes in temperature

The Technical Differences Between the MacBook Neo and MacBook Air

AI in Warfare Is Here