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?

Agent Atoll: Visualise your Claude Code/Codex history on a 3D living archipelago

Visual Lean: An experimental graphical user interface for writing Lean code

Ask HN: What should I do with 50k verified emails

Big Tech Will Not Broadcast Your Dissent

SaaS Development Outsourcing: 20 Questions to Ask Before You Sign

Nordstjernen Web Browser

JEP 543: Structured Concurrency (Java 28)

Anthropic disclosed an $80.7B net loss for the first half of 2026

Is Hacker News still a good predictor of tech trends?

AI video effects from one or two photos, without writing prompts

Signs your software project needs rescuing – not another sprint

Did Satoshi Get Bitcoin Wrong? Claude's NSA Discovery Sparks Debate

ByteDance, Alibaba, Tencent place over $35B worth of Nvidia chip orders

Claude Code Spotted a Cryptominer on Mac While Building a Temperature App

Learning by building a multi-agent design lab. Yet, single agent works better

Finland Buying a Million Landmines

Programming by hand is fun but it's better to not have to do it any more

European personal agent for knowledge workers

Guy made a site to spot SLOP games on NEXT FEST – it is vibe coded

PolicyWatcher – Independent monitor of privacy, ToS and AI policy changes

Parallelizing MySQL Snapshots

We Replaced Fyxer Overnight

Predicting cancer survival using face photographs

File Attack Deep Dives: Office Documents as an Attack Surface

Spread: Launch faster. Break nothing. Know why

Battle Drones–a vibe coded RTS with audio-based multiplayer

Zoomies.sh

Ahead-of-Time Compilation of JavaScript to WebAssembly via Static Type Inference [video]

A Bicycle Journey Across Brazil to Find a Vanishing Savanna

Ask HN: What's a good RSS feed reader?