Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

spockz•11mo ago

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

cstrahan•11mo ago

No, one example of why being variable sized integers.

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

carterschonwald•11mo ago

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Show HN: OpenRig – agent harness that runs Claude Code and Codex as one system

The Problem Isn't the Model, It's What It's Reading

Deep Dive into Efficient LLM Inference with Nano-vLLM

Your article about AI doesn’t need AI art

Apple App Store threatened to remove Grok over deepfakes: Letter

Reframing the Developer Experience of Data Assembly

John Deere Pays $99M to Settle 'Right to Repair' Class Action

Did Taylor Swift Kill a Bunch of People?

Characterizing the repeatability of cardiovascular responses to hypoxic apneas

Pointer-Stable Dynamic Arrays

NASA chose the right crew to launch a new era of human space exploration

Meta creating AI version of Mark Zuckerberg so staff can talk to the boss

Show HN: Spectre: A systems design-by-contract language, self hosted compiler

NixOS example config using the dendritic pattern with flake-parts and hjem

The Myopic Architects

Sidecar: Mirror VS Code Copilot Chat to your phone over a WebSocket bridge

Is the Strait of Hormuz Open?

CadQuery is an open-source Python library for building 3D CAD models

Netgear Scores the First Exemption from the FCC's Foreign-Made Router Ban

Suckless Screenshot Utility for Xorg

Show HN: I built a self-improving autonomous AI agent that runs 24/7

Italy Implements a New Labor Leave That Allows Workers to Care for Sick Pets

How Depression Physically Feels

Punjabi Kids YouTube – Rhymes and Learning

I built an AI podcast that roasts a company with Lennys Newsletter as ammunition

Measuring Human Performance on ARC-AGI-3

PyCon needs 1,146 more hotel nights to meet "hotel minimum bookings."

You can literally build a neural network w your hands. This CTO open-sourced how

The Most Boring Book in the World

A Terminal Spotify Client