Packed Data Support in Haskell

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

77•matt_d•12mo ago

Comments

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

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

Zolomon•12mo ago

They mention this in the article.

spockz•12mo 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•12mo ago

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

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

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

lordleft•12mo ago

This was very well written. Excellent article!

NetOpWibby•12mo ago

Is this like MessagePack for Haskell?

Show HN: ShadowPEFT – Centralized and Detachable Parameter-Efficient Fine-Tuning

10-cm Japanese origami CubeSat unfolds to 25X its folded size

I ported AudioGen to MLX so it runs on Apple Silicon

Insider stories on agent engineered startups

Do I belong in tech anymore?

Altman apologizes: OpenAI failed to alert police before fatal Canada shooting

Ask HN: MicroVM setup for VS Code Dev Container-like experience?

Encrypting Encrypted Traffic to Get Around VPN Bans

Ask HN: Turned away from A16Z Speedrun Cafe – another founder wasn't

Oxford All Souls College General Examination [pdf]

Spec-in-CI-Driven Autonomous Agentic Development

Quirks of Human Anatomy

GitHub Copilot: GPT-5.5 7.5x more expensive under promotional pricing than 5.4

Firebase Competitor hits 1.3M Session Replays

Turbo Vision 2.0 – a modern port

Show HN: Built an AI that maps 17 facial dimensions and shows what to improve

138k LOC removed from Linux kernel to defend against LLMs

Show HN: Collaborative sentence builder with real-time voting

Explaining Projects Need to Scale

ratarmount: Access large tarballs as a filesystem efficiently

Superfetation

When Your Digital Life Vanishes

I scraped Reddit for 51 founder complaints and turned them into 17 SaaS ideas

Frontman is an open-source AI coding agent that lives in the browser

Need 12 testers for 14 days

What's New in Firefox 150

A pipeline that forces AI to justify decisions before acting (I'm a florist)

I just beat AI traders with math

Global Telecom Exploitation by Covert Surveillance Actors

Show HN: Bunny Agent – Build Coding Agent SaaS via Native AI SDK UI