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?

Tell HN: Codex once again autmatically activates /fast on app update

The Great Powers Are Learning They Have Limits

South Korea's SK Hynix Eyes US Listing as Soon as August

I built a tool that automates the creation of vertical Quran recitation videos

The Illusion of Control: When Complexity Outpaces Mastery

What Happens to a Balloon That Keeps Rising into the Upper Atmosphere?

Show HN: Plug and AI – Slack bot for the whole team, not per-seat

Claude Fable 5 silently degrades its own performance on frontier AI work

Notepad++ Zero-Click RCE via Path Traversal (CVE-2026-52884)

Show HN: Tapflow – self-hosted iOS/Android simulator streaming for mobile QA

Implementing Live Cryptocurrency Trading with DolphinDB

This was probably a dumb gamble

Uppinote20 Claude-Dashboard

BareMetal

Implementing a Funding Rate Arbitrage Strategy with Backtesting

Port React Compiler to Rust

Broadcom: The private cloud is where enterprise AI workloads are being deployed

Show HN: Are.na Commander – a file-like Are.na browser

Faking keyword arguments to functions in C++

Not having an opinion on SpaceX is going to cost you

Only Bounds

Third Interconnect Attack to Break AMD SEV-SNP

FPGA-Accelerated Lock Management and Transaction Processing

From physical therapy, dance to workout with real-time coaching

The Field Guide to CSS Grid Lanes

Junior Devs Who Use AI Are Not Cheating – They're Training Smarter

Stolen Lego, Mormons and corrupt Cops – a recap of all the major facts

Study links joint pain supplement to accelerating dementia

Show HN: HolaClaw, an OpenClaw Distro for macOS

What if gravity broke for 60 seconds?