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?

FlashStore: A Ceph OSD Rewritten in Rust for NVMe

Self-hosting email the hard way from your own routable IPv4 block up

Two Apps One Process

Fortune Telling and Speculative Design

Terraform governance: using incident evidence and plan output to define "fixed"

How to control unit tests in Agentic Pipelines

My notes app has no database, just a folder of Markdown and an MCP server

Max Hardberger: Repo man of the seas (2010)

Fireworks AI security breach impacts Notion and their customers

MeterMesh: Count SaaS usage in a small Go mesh before Postgres

RippleMap – Map dependencies across GitHub repositories

New Details Emerge in Amazon Ads Auction-Rigging Case

Mailgun SMTP is moving to TLS 1.2: What you need to do before the March 1, 2027

S.t.a.l.k.e.r. Call of Pripyat in WASM and WebGPU

Microsoft are rejecting your mail

JPMorganChase expands Claude Code to more employees across the firm

Gostman, the open source API client

Camoufox for Web Scraping: Setup, Proxies and Servers

Ask HN: Have you seen any outstanding GitHub repo?

Web Scraping in 2026: Six Insights from Pierluigi of the Web Scraping Club

Can You Explain a Zipper? Why AI Makes You Feel Smarter Than You Are [video]

From Text Scripts to Animated Memes: A Guide to Creating GIFs with GPT Image 2.6

The Economics of Distrust: How the Market of Authenticity Consumed Itself

Hire AI Agents and Pay in Monero (XMR)

Show HN: Willder, an open source context layer that syncs apps, agents and teams

We're launching an in-game AI agent for WoW

I was wrong about dark mode

BasicOboe: An easy to use but powerful Google Oboe library

Mario 64 on the Canon EOS R8

A C++ Quicksort Faster Than std:sort