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?

48000 Samsung workers ready to strike

Solar cells on vehicles can take the pressure off the grid in Europe

Show HN: IResearch – C++ search that beat Lucene and Tantivy on their benchmark

The Cyber Reality States Don't Want to Admit

ConverterToMarkdown – Convert Docx/PDF/XLSX/HTML to Markdown In-Browser

WordPress Migration in 2026 (from A to Z guide)

Infrawise – Give Claude Code real infrastructure context via MCP

"Stick" – A primitive/fun interactive demo of a tiny rig to animate layout

Tarotui – A tarot reading experience in the terminal

Love is to be invested in someone's continual expansion

UniFi Network 10.4

Open-source energy system model for the ENTSOE Ten-Year Network Development Plan

Learnings from 100K lines of Rust with AI (2025)

Google Just Killed Search as We Know It

Artist with no technical experience stumbles upon the next generation of LLMs

Carbon: open-source DNA foundation models with training code and data pipeline

Cities: Skylines Uses a Stock-Market Analogy to Influence Gameplay

How Big Tech is harnessing the data of Indian factory workers to train robots

Goodbye ChatGPT

Bolt CEO let go of his HR team for creating problems that didn't exist

Honeybee venom and melittin suppress growth in breast cancer (2020)

The Sky Heist

Ask HN: How to make a mono-repo AI-Ready?

Velocipedia

PostgreSQL backup tool gets some backup of its own

Public have more fear than hope on AI and future of work, study finds

Coding Slow Is Smooth, Coding Smooth Is Fast

Show HN: Kreuzberg Cloud – ultra fast content intelligence – in public beta

Show HN: Widget Cast – Video Widgets for Your iPhone and Apple Watch

Elevated radiation levels detected on Russian drone debris