Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•10mo ago

Comments

nine_k•10mo 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•10mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•10mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•10mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•10mo 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•10mo 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•10mo 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•10mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Benzene changed chemistry forever – with Judy Wu [video]

I Didn't Like App Launchers for Arch Linux, So I Wrote My Own in Rust

OpenPencil – AI-native design editor. Open-source Figma alternative

Understanding Rope: From Rotary Embeddings to Context Extension

Mobile Is Not a Smaller Web App

UKI: Unified kernel images for booting Linux from UEFI

FinMind Universal Deployment (Docker and K8s and Tilt)

Kuva: A scientific plotting library in Rust

Vercel down in Dubai, EU affected also

Overlooked and overexploited: Extensive conversion of grasslands and wetlands

Open source Bluetooth dynamometer for climbing training

Robotics changes everyday but it is still the same three things

Show HN: OpenBerth – Deploy AI-built apps and tools to your own server

Show HN: FinMind One-Click Deployment (Docker and K8s and Tilt)

Show HN: Why LLM Personas Collapse and How Structural Identity Fixes It

Show HN: Bunny Calculator – A fast, free, and clean suite of web calculators

The Orality Theory of Everything

Really? We're Fucking Doing This Again?

Show HN: Hush: Blur your messy desktop during screen sharing (macOS)

Ask HN: What sources like HN do you consume?

Hardware hotplug events on Linux, the gory details

Australia Announces Support for US Invasion of [Insert Country Here]

Apache Iggy's migration to thread-per-core architecture powered by io_uring

Test Your Claude Code Skills

Motorola confirms GrapheneOS support for a future phone, bringing over features

Ask HN: How are you all staying sane?

U.S. science agency moves to restrict foreign scientists from its labs

How to Write a Good Spec for AI Agents

Show HN: XPilot – Your X presence, on autopilot

cargo-shear: Remove unused dependencies in a Rust project