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?

Resyl – AI memory that ties your notes to people instead of folders (Android)

Zerostack v1.3.2 Released

Building Pi with Pi

Life with locked-in syndrome: 'Despite everything, you are alive'

Does the human still make the decision?

Don't know where your data is from? Bayesian modeling for unknown coordinates

Preventing AI agents from executing destructive terminal commands

Enhanced Games CEO insists 'Doping Olympics' is safer than traditional sport

The Wizard with the Defensible Pond

Advancing Mathematics Research with AI-Driven Formal Proof Search

Agents Dont Want VMs

The Energy Transition Is Happrning Faster Than You Think

Topo Designs Rover Trail Pack Is the Best Backpack I've Ever Used

A Dual-Node Home NAS Cluster for $210

Hitler as a Unit of Measurement

When Canada's Metric Switch Left a New Boeing 767 with Half the Fuel It Needed

Active supply chain attack across NPM, PyPI, and Crates. io

An Introduction to Objectivist-C

New Rocket League is using Unreal Engine 6

Can't they get the small science stuff right?

What Gets Kept

Oss.zone, a Pubnix Running on NixOS

Apple Preparing New 'Gen AI' Website Ahead of WWDC

FieldStation42 – Turn your computer into a vintage TV cable system

Beating C with Dyalog APL: wc

Dynamical Governed Topology Engine with 3D Viewer

FreeBSD Foundation Executive Director Tries Daily Driving FreeBSD on Laptop

First ever Cray T3D Supercomputer goes up for auction with $81,000 reserve

AT&T sues to ditch Cali copper phone lines to save billions

HP investigating BIOS updates that leave premium laptop users in boot loop limbo