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?

Using ChatGPT is not bad for the environment

Show HN: HN Keyboard Boost – Minimal Keyboard Navigation for Hacker News

Sam Altman: This is how we can make AI safe for everyone

Inside the Egg Price-Fixing Scandal That Spiked American Grocery Bills

Ella: Deterministic compute engine for ultra‑low‑latency systems

HT-ML.app – Deploy HTML Artifacts from Claude Code and Codex

The Repository Knows Why

Taming Production Database Migrations

Jj jj jj jj jj

Florida Is Executing Prisoners at a Record Pace

Is there a "is fable up tracker" or notification hook?

Palantir vs. Republik [Swiss News Magazine]

Reduce GVisor Cold Starts with GPU Snapshotting

Explaining relationship-based access control with a MIDI keyboard [video]

Show HN: I built a way for coding agents to use secrets with O seeing them

Show HN: Hunch, search your email by a hunch; with a conversation

How the World Cup Builds Nations

Uber Shakes Up AI Data Labeling Business, Dismissing Top Leaders

Why I like snake_case

My Notes After Databricks Data and AI Summit 2026

Vektorgeist

Grand Elemental, primordial matter churning like a living planet core

Our First 66 Azure Deployments Show Interesting Patterns

ZCode: GLM-5.2's own harness is officially live

Proposed new satellite fleets could overwhelm the night sky

Tidal hits subscribers with a 200% price increase

Pidgin 3.0 Alpha 2 (2.96.0) has been released

CorvinOS – self-hosted agentic OS where EU AI Act and GDPR compliance by design

Amsterdam Invented the Fire Department

Ask HN: Freelancer? Seeking freelancer? (July 2026)