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?

Show HN: Multi-agent coding feels like pre-GitHub development

Laya "System 1" Code Intelligence for AI Agents

Full iPhone 4 'Antennagate' Q&A Video Surfaces After 16 Years – MacRumors

Jamie Beaton might end up the world's most educated person

Vitvm: Git for VM State

Docker releases cloud sandboxes, enabling safe agentic workloads in the cloud

Gmux: Tmux for GPUs

Platform-Independent SIMD in Go

Protecting our knowledge of human genetic diversity

Show HN: Jev-pilot – Jev picks Claude Code's effort, model and skill per prompt

Preventive Software Maintenance

4% of Sessions, 65% of the Bill: 30 Days of Claude Code Telemetry

Back and shoulder surgery is often worse than useless

Software-only quantum tool, it breaks RSA-2048 live

Danish Health Minister summoned over secret Wegovy court proceedings

Which AI model is best for coding? A hands-on comparison

C74-6502 Overview

Grieving the Loss of Details

Dolphin Emulator Progress Release 2609

Sir Ranulph Fiennes kept in care home illegally

Bluh

Amiga Screens: A Primer

Cheap and Awesome

Adam Conover explains how YouTube ruined everything

Google's first Suncatcher orbital data center test launches October 1

Pick OS Is a Living Fossil of Computer History

Ask HN: IEEE Expulsion of Fei-Yue Wang?

Redditor Connects an AMD GPU to a MacBook Pro

More than $170M in crypto moves from Bitget wallets to unidentified address

GTM Engineering Skills.md Toolbox