Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

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

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

HappyWish – An AI tool I built for a problem I kept having

Show HN: LoongFlow – Directed evolutionary search framework for LLM agents

The Rise and Fall and Rise of American Publishing

Statistical Rethinking (2026 Edition)

[2024] Why were the 1930s so hot in North America?

Show HN: Bugbop – a smaller bug bounty platform

Nexels: Neurally-Textured Surfels for Real-Time Novel View Synthesis

"TSMC's U.S. Production Costs 2.4 Times Higher Than That in Taiwan"

What's the difference between instructor-led training and self-paced learning?

Breakthrough Technologies for 2026

Microsoft warns that China is winning AI race outside the West

Young Adults Face Hidden Metabolic Damage from Ultra-Processed Diets

Show HN: IT Word Search Labs – A Word Search Game for Tech Learners

Will AI replace senior engineers, or will it change what they do?

Lawsuit Challenges Arizona Engineering Licensing Law

Show HN: Omni Animated Tiling WM for macOS (Niri and Hyprland)

Clan 2025 Wrap-Up: From Infrastructure to a New Computing Paradigm

The Only Cure by Mark Solms review – has modern neuroscience proved Freud right?

Show HN: HN Print – turn Hacker News stories into a printable newspaper

Ask HN: What's your opinion on a VR/XR business?

JustRead vs. Apple Books vs. Kindle vs. Book Fusion: A Screenshot Comparison

Havana Syndrome Device Purchased

The Surprising Truth about Exercise and Childhood Obesity

Ask HN: Why are AI coding agents not working for me?

ArkhamMirror SHATTERED: Air-gapped investigative analysis, no Palantir required

What Is Ruliology?

Show HN: I built a reusable SaaS company list

How London cracked mobile phone coverage on the Underground

The Cost of PostgreSQL Arrays

Ask HN: What is your meaning of life?