Packed Data Support in Haskell

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

77•matt_d•8mo ago

Comments

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

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

Zolomon•8mo ago

They mention this in the article.

spockz•8mo ago

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

cstrahan•8mo ago

No, one example of why being variable sized integers.

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

carterschonwald•8mo ago

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

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

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

lordleft•8mo ago

This was very well written. Excellent article!

NetOpWibby•8mo ago

Is this like MessagePack for Haskell?

China's Birthrate Plunges to Lowest Level Since 1949

Wireless Earbuds Can Be Hacked

Does changing DNS make internet faster

EU's 'nuclear option' of moves against Trump tariff threat

Show HN: NeuroReel – AI that generates viral TikTok/Reels slides from a topic

Velisch zeigt neues Crypto‑API‑Beispiel: kompletter Service in einer Date

Show HN: Ali v0.8.0 – Exportable load test results

Show HN: Learning Path for CBSE Math

Writing First, Tooling Second

Sheety-CRM: A stateless, open-source CRM built on Google Sheets

Anthropic disabled my account after payment cancer patient/medical data trapped

A faster, cleaner way to use the Internet Archive

Sequoia to invest in Anthropic, breaking VC taboo on backing rivals: FT

WhatsApp

Ask HN: How do teams handle dynamic tool discovery for AI agents?

Show HN: CervellaSwarm – 16 AI agents and 3 debug guardians, coordinated via MCP

Show HN: Interactive physics simulations I built while teaching my daughter

How crypto criminals stole $700M from people – often using age-old tricks

"Don't worry. Boys are hard to find." Part 1 o2

Scaling long-running autonomous coding

Run AI tools like Cursor,Claude Code, Codex on your own models

Manage Claude Code Visually

Are Arrays Functions?

AI Coworker

Show HN: Prediction Market Dominance Index

Production-Grade RAG Pipeline for Technical Documentation

Search 40M docs in <200ms on a CPU using binary embeddings and int8 rescoring

Statement from the Nobel Foundation

Beowulf's opening "What" is no interjection

Paying attention to Attention