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?

Dead Forest Theory

Wing Commander IV and the FMV future that never quite was

Ancient Greek Technology: The Origins of Robotics and Engineering

RetroPad: A Tiny Notepad-style Windows text editor ~2.5kb

Two nasty surprises in Home Assistant's config

Urban thermal structures in scenarios of hot weather: The Bologna study

QuickFolder: Android Home Screen Organizer and App Launcher

When AI agents get you kicked out from a YC Startup

Australia probes mystery space balls that washed up on beach

Ghostlog: Live terminal UI to monitor AI coding agent Git commits

Paint the Earth on a live interactive globe

Chemical accidents rise as Trump administration proposes weakening safety rules

Show HN: rockbox-dsp – A reusable Rust DSP library extracted from Rockbox

The Company Founder Who Got Fired for Ignoring His Own Return-to-Office Rules

Show HN: Meon – declarative flat-parsing engine (SoA, no AST)

Show HN: Aletheia – The Uncertainty Loop Agent for Claude Code and Codex

Engram – persistent memory for AI agents, in-process, no cloud

Moving Back Home Used to Be a Sign of Failure. Now It Shows Financial Savvy

Cursed Gemstones – The Koh-I-Noor Diamond

Longcat

Istota – a multi-user AI agent and personal OS

The Computers Used in Movies

SOLAR: AI-Powered Speed-of-Light Performance Analysis

Taphonomic analysis reveals behavioral & tech capabilities of Homo floresiensis

Show HN: Goldseam – heal broken Cypress selectors with a local LLM

WSL Keeps Getting Better

Show HN: Detecting AI slop with regex and Stephen King

Why High-Earning Families Are Leaving Traditional Schools for AI

How Bending Spoons built a $23B tech empire from struggling brands

Dead Man's Switch and USB Kill Switch for Linux, Security Project