Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

The Closing of the Frontier

Show HN: 2048 with a Leaderboard

Deep Work on macOS Starts with Context, Not Blockers

How Transistors Work (1995)

Bringing Rust to the Pixel Baseband

The Making of Dark Castle

Strategy Letter V (2002)

A Fake Screen Fixed My macOS Space Switcher

The Brutal Reality of Today's Job Market 2026

Ukraine and Weapons of Mass Destruction

Jet Fuel Crunch Is Getting Severe with No Reprieve in Sight for Airlines

After Me(One encrypted vault. One QR code. Your family gets everything)

I Pick My Stack for Vibe Coding

Show HN: Git why – log your agent reasoning trace along your code

AGI Is the Wrong Word

Democratic AI to serve the public – OneProject.org

NetWatch v0.11.0 – TUI network diagnostics, now with connection filtering

I built a free 30-day habit tracker in Google Sheets

Ask HN: What is the most annoying part of scheduling meetings?

Chromium Fingerprint Simulation Framework Assessment

Ask HN: Has anyone reconsidered Antivirus software after recent security news?

PandemicAlarm – Free disease outbreak tracker aggregating WHO, CDC, and ProMED

I built a free Canadian tax estimator for self-employed people

AI Is Tipping the Scales Toward Hackers After Mythos Release

Transaction-level provenance for AI art certificate/signed/license on every sale

AI still can't figure out PowerPoint

LPM 1.0 – Video-Based Character Performance Model

Anyone know how I can cancel this? I dont want it

Tell HN: See the AI Doc

Why Aren't We Uv Yet?