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?

Jensen Huang Must Resign

A fast, POSIX/GNU-compatible Awk written in Rust

Membrane

Scribe v3 and v3 Live

Retirement Savings Are Fueling the AI Bubble

Claude Reverse Engineered my 32-year-old Jeep and Started Controlling it

ContextCall – cross-platform alternative to OpenOats

Self-Specialising Neuromorphic Compute: An Architecture Beyond the NPU

SocGen looks to offload Stargate data center debt at discount

Team unlocks large-scale Fourier transforms for analog in-memory computing

The Worst Thing About AI Writing

Everybody can make their own weight-space models

Art

Cancer vaccine for Yash, he's diagnosed with stage IV pancreatic cancer

Tests as Data

Access models for security and safety work that mainstream AI often refuses

Former id Software developers establish worker-owned, independent studio Hidden

Show HN: Daily Atlas, my geography quiz game where rarer answers score more

Show HN: Collection of Beauty–a walkable 3D museum of public-domain art

Show HN: Spared – self-hosted Workers and Durable Objects for Rust apps

Airlock, a checker for AI models going into air-gapped networks

The Perverse Reasons Healthcare Costs Are About to Surge

MakerWorld removed my free card holder over "UNO". Now Mattel's agency wants 4k

Why mental health providers need to deconstruct their own patriarchal thinking

The Death and Afterlife of the Segway

Thorium Nuclear Reactor Explanation [video]

Meta's Head of Infrastructure, Engineering to Depart in 2027

VW drops 'Gamechanger' production at main plant, risking escalation with workers

A Psilocybin Journey

Laser-armed AI submarine robots patrol Norwegian salmon farms, killing sea lice