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?

Ares: Multi System Emulator

Fake accounts defended Jensen Huang and attacked lawmakers over chip exports

Fixing a 25 dB LR1110 LNA gain bug on the Elecrow ThinkNode M9 (WadaMesh)

An Obituary for My Grandparents

What's New in Node.js 27

The Zig project is going nowhere

I photographed cosplayers at Tokyo's Halloween festival

Do verifiable metrics overestimate RSI?

Show HN: Pure-JavaFX God's Eye View – Tracking flights and live cameras [video]

Show HN: Reinwatch – a Claude Code mod that stops runaway subagents

Apple TV introduces new Sign Language interpretation feature

30 Years of Internet Transfers with Curl

Show HN: Pots – Open-source Grok Bot alternative, used by 6 startups for a month

Open-Source HF Communications for Remote Communities and Experimenters

Show HN: Ember.js, Re-Born in Rust

User Mode Linux by Jeff Dike [pdf]

Field pointers as column names: compile-checked Go queries without codegen

Ask HN: Why didn't The Bible warn/tell us about AI?

How Climate Change Is on Your Plate

AI Agents in Multicultural Teams: Will We Need a Global ID?

We can now build considerably more, but should we?

Three Thousand Years of Life

Show HN: small WireGuard mesh VPN with no coordination server

The Housing Market Is Nuts

Would your home survive World War Three?

Lokey – A native Android keyboard with local AI for prediction, autocorrection

AMD EPYC 9006 Results Are Here and AMD Delivers a Knockout Part Deux

MacroHands: 3D hands and camera pose from egocentric video

A review of the federal governments mishandling of the Epstein ... [pdf]

Cloud Projects sessions run at low reasoning effort while effort_level is "high"