Packed Data Support in Haskell

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

77•matt_d•11mo ago

Comments

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

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

Zolomon•11mo ago

They mention this in the article.

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

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

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

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

lordleft•11mo ago

This was very well written. Excellent article!

NetOpWibby•11mo ago

Is this like MessagePack for Haskell?

Astronomer May Have Witnessed a Comet Stop Its Spin–Then Reverse Its Rotation

Book Review: There Is No Antimemetics Division

Book Review: Piranesi

Book Review: What We Can Know

A DIY OpenClaw

Building a Custom Claude Code Statusline

Is.team – AI agents and humans on the same project board

Anthropic says Claude Code subscribers will need to pay extra for OpenClaw usage

Adam Curtis Fears AI Is a Hungry Ghost

Txpay.app – Your Crypto Payment Link

Open States strives to improve civic engagement at the state level

Exposing and Understanding Scrolling Transfer Functions (2012) [pdf]

Benchmark-Dependent Output Dynamics in LLM Prompt Compression

Leaked texts reveal how Russian spies recruit, pressure and run their informants

BlackIceHQ – detecting account takeover from login sequences

TecBot

Full Report: What Claude Code Actually Chooses

Ask HN: How are you orchestrating multi-agent AI workflows in production?

Hallucinated citations are polluting the scientific literature.What can be done?

Pscale – Logarithmic compression for LLM knowledge bases

LiteClaw – Use Claude Code from Your Phone via Telegram

Value numbering

I Woke Up Not Knowing Who I Was – Building an AI Robot Brain [video]

If we hope to build artificial souls, where should we start?

Show HN: Expi – Local No Subscription Converter and Media Editor

Is grep all you need for agentic search?

SpectralQuant: Breaking TurboQuant's Compression Limit via Spectral Structure

We Built a Skills Optimizer, Here's What We Learned About Claude Code

Show HN: I built a theme engine for white-label apps using OKLCH color science

Full Anatomy of Mercor's Data Breach