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?

The Arena

Dobium: $0 commission prediction exchange

The World as a Hologram

The millionth.bid: the last bidder's quest

US lawmakers aim to keep China's tech out of sensitive government systems

Planetary Gear (Code Art)

Show HN: Jevlang. delegate every if/while to Jev

Cognition Crosses $1B in Annualized Revenue Run Rate

Distributed Quantum Compiler (DQC / XDQC) by MemQ open-source now

Great News from Saturn's Moon Enceladus in the Search for Life in Space

Make an animated pelican on unicycle jugging fish while explaining bash command

Lecture: Blowup for the Euler Equations with Smooth Forcing – Tristan Buckmaster [video]

Ask HN: Is multi-model redundancy now a compliance requirement for small teams?

Show HN: A dashboard for tracking usage limits across Claude, Codex, and Cursor

Walgit: A Git server that is one binary in front of an object store

Show HN: CoordMap – free browser tools for coordinates, elevation, and distance

Trading a Cloud Identity for Your Own: Workload Attestation on Managed Compute

Were 1970s Korean Orphanages a Great Place to Raise Kids?

A thesis isn't enough for a PhD

Revelations of dozens more platforms hit by OpenAI agents

The Universe Rendered in ASCII

We're gonna need a lot more mathematicians

Show HN: Safe-fetch – a Python URL fetcher with per-redirect address checks

Eremina Desertorum

Lix: Version control system for files and tables

Guitar amp and effects pedal built on the Waveshare ESP32-S3-Touch-AMOLED-2.06

ShinyHunters Renewed Mass Exploitation Campaign Targeting Oracle PeopleSoft

Faster Transport on Cloud Infra

Yamtam.nyc – yet another mass-transit all-in-one map

Deep Scattering Layer