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?

Scientists Figured Out How Eels Reproduce (2022)

Open macro placement benchmark and $20k challenge (HRT-sponsored)

Open source CAD for Windows 2000 (SolveSpace)

Show HN: place-clone – A nostalgic revisiting of r/place

The End of Chatbots: AI Is Moving into the Workflow

Ask HN: What's your cool use case for ChatGPT Containers?

A Memoir of Spreadsheets: From VisiCalc to Google Sheets

Droid TW 12.7

"Vibecession" reflects an increasingly difficult economy and society

Live: Artemis II Launch

The Windows equivalents of the most used Linux commands

Show HN: I/Claude reverse-engineered Figma's binary WebSocket protocol

Apple releases iOS 18 security updates for iOS 26 holdouts

Claude Wrote a Full FreeBSD Remote Kernel RCE with Root Shell (CVE-2026-4747)

Politics Keeps D.C.'S Autonomous Vehicles Roadblocked

Age of Invention: Why Scotland Succeeded

Environmental Pollutants Modulate Extracellular Vesicles for Cancer Promotion

Trusted Publishers for All Package Repositories

If you read cursive, the Newberry has a job for you

Intent to Experiment: Agentic Federated Login

A Skill for Easter: Teaching Claude to Speak EventSourcingDB

Show HN: Continuously Improve Claude Code Plans

A pathogenic Tau mutation drives dysfunction limiting Tau degradation

Wikidata: WikiProject Ontology/Ontology Course

I, Sysadmin

Do Not Stick Out

FusionAuth Brainfuck SDK Repo

Kremlin Enters the Chat with Russia's New Super-App

AbodeLLM – An offline AI assistant for Android devices, based on open models

Computer Repair in Oklahoma City, OK