Packed Data Support in Haskell

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

77•matt_d•9mo ago

Comments

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

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

Zolomon•9mo ago

They mention this in the article.

spockz•9mo ago

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

cstrahan•9mo ago

No, one example of why being variable sized integers.

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

carterschonwald•9mo ago

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

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

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

lordleft•9mo ago

This was very well written. Excellent article!

NetOpWibby•9mo ago

Is this like MessagePack for Haskell?

Hacker News front page now, but the titles are honest. #2

Intrinsic Loneliness

GPUs Became the Newest Financial Asset

Hacker News: Savage Mode

Show HN: Infinijest, Video Feed Experiment

Borges' Library of Babel Online

Scott Galloway Explains How You Can Stop Government Overreach

AI Subscription vs. H100 [video]

How to Donate to the Debian Project

Using an LLM Gateway to Keep My Agent Config Stable

What I Learned Making 34 Novels with Claude Sonnet

Show HN: Seedance 2.0 Pro AI Video Generator

Prolog-blog-engine: blog engine in pure Prolog. 0 dependencies, Markdown, server

Period three implies Chaos (1975) [pdf]

37signals Isn't Smarter Than You, but They Are Different

Easy_Claude_code

How Photos Are Cabled Across Atlantic (1926 Illustration)

I slopcoded an open source version of Xilly's GameMode after the X fiasco today

Claude Code suggests .claudeignore to protect .env, reads it anyway

Tinykit: Self-hosted Lovable/v0 alternative. With Realtime database and storage

The Great California Wealth Exodus

Microsoft Needs a Windows Social Contract

Show HN: Compile Python libraries for TypeScript with type completion (umo)

Heathrow Drops the Liquids Rule

AI Content Disclosure for HTML

Sepp Blatter suggests fans should not travel to US for World Cup

iOS 26.3 Adds Privacy Setting to Limit Carrier Location Tracking

Claude Code Ported LeelaChessZero CUDA Back End to ROCm: End of CUDA Moat

Agentic coding is accelerating app releases

Show HN: Free image-to-JSON converter (extract structured data from images)