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?

A Fast IPv4 Parser, in Swift

Google Cloud is down in the Europe-west2 region

How Do Airports Prepare for Disaster? With Fake Screams and Cloth Dummies

17k Lines of New Rust Kernel Code Heading into Linux 7.4

An RL agent learning to land a Falcon 9 on a droneship in simulation

DeepInfer, our in-house inference framework, now open source

Nvidia Vera's System Architecture: Pushing Bandwidth

Japan launches mission to bring home a piece of the Martian moon Phobos

Demystifying Spherical Harmonics: An Optimization Approach

Show HN: Family quality-of-life score for every US county (108 indicators)

Show HN: A giant pixel map of London

Revolut Partially Unavailable

Study: New AI tool can predict cancer survival by a single patient selfie

Hackers steal 421,000 emails belonging to members of Germany's far-right AfD

Revolut (bank) down since 3 hours

Google Cloud Service Disruption in UK

GitHub's new license gate can block merges. Roll it out carefully

Revolut down as users report app not working

Twilight at the Banyan Tree

I Did This Without Your Knowledge

Amazon to fund 12 small nuclear reactors at former Indiana coal plant\

You can control this robot (for free)

Stateless Agents: How to make AI work for teams

Alberta votes to remain in Canada with 70% voting remain

Ask HN: Will Proton integrate Standard Notes?

Building a reinforcement learning system for e-commerce search

Show HN: PurePDF – merge, split and compress PDFs in the browser with qpdf/WASM

Show HN: 80s computing era meets small local decision models

AI slop is a human problem

AfD Leak: What 421,179 Hacked Emails Show about the German Far Right