Packed Data Support in Haskell

https://arthi-chaud.github.io/posts/packed/

77•matt_d•10mo ago

Comments

nine_k•10mo 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•10mo ago

We are always reinventing wheels. If we didn't, they'd all still be made of wood.

Zolomon•10mo ago

They mention this in the article.

spockz•10mo ago

It reminds me more of flat buffers though. Does protobuf also have zero allocation (beyond initial ingestion) and no pointer jumps?

cstrahan•10mo ago

No, one example of why being variable sized integers.

See https://protobuf.dev/programming-guides/encoding/

carterschonwald•10mo ago

One thing that sometimes gets tricky in these things is handling Sub term sharing. I wonder how they implemented it.

tlb•10mo 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•10mo 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•10mo 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•10mo ago

honestly i wish more stuff worked this way - fewer hops in memory always makes me happy

lordleft•10mo ago

This was very well written. Excellent article!

NetOpWibby•10mo ago

Is this like MessagePack for Haskell?

Schedule Recurring Tasks in Cowork

Apple Foundation Models SDK for Python

Americans Are Leaving the U.S. in Record Numbers

What I learned from 14,000 AI agent sessions

Why is your Mac WiFi Slow?

Disrupting the Gridtide Global Cyber Espionage Campaign

Code Is Cheap – Now What?

How to Thrive as a Remote Worker

Terra would have collapsed regardless of Jane Street

Could a vaccine prevent dementia? Shingles shot data only getting stronger

RAM now represents 35 percent of bill of materials for HP PCs

Show HN: Automatic Image Localization Pipeline

Building Governed AI Agents – A Practical Guide to Agentic Scaffolding

Trying to Access ZFS-Encrypted SSD Following a Kernel Update Failure (2025)

Abandoning Resend.com for Email

I hate my company's AI initiatives

Turns out Generative AI was a scam

Former U.S. Air Force Pilot Arrested for Providing Services to Chinese Military

Mitchell Hashimoto's new way of writing code

Solar Thermal Energy Conversion with a Multilevel Inverter Circuit

Show HN: Relocate.ai – AI reports for families moving abroad

Open-Source Ecosystem Whale Falls

Show HN: Decision Tree Builder

Show HN: ImageCFN – Analog, Resolution-Independent Image Representation

Trump admin halts [$250M of] Medicaid payments to Minnesota over fraud claims

DeepSeek withholds latest AI model from Nvidia, AMD

Show HN: OpenSwarm – Multi‑Agent Claude CLI Orchestrator for Linear/GitHub

Show HN: EV424 – Reproducible Integrity Receipts (Don't Trust, Verify)

Reverse-engineer an MP3 player's firmware using LLMs

Show HN: Usplus.ai – OpenClaw for Enterprise. Autonomous Agents to get work done