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?

Flasta Cut – cabinet cutting lists and sheet nesting in seconds

1776 or 2026, Spot the Difference

European Cities Deploy Nvidia-Powered AI Agents to Run Smarter Urban Operations

Show HN: Recreating Gemini Argon 3D demo using ExtrudeAI and FreeCAD

Global Smartphone Shipments Hit a New Low with 20% YoY Decline

Environmental Exploitattion and Deception

Why Sweden is abandoning its cashless society

Show HN: Ruleherd – audits agent instruction files for contradictions and drift

The End of the Era of Trust: An Essay on Voice Cloning

An agent reviewing other agent's work

DAVx⁵ – CalDAV / CardDAV / WebDAV for Android

Transflective LCD

The Septopert: A Provably minimal nopert

Wireless magnetic millirobots that deliver medicine inside the beating heart

Show HN: Agent Identity – Identity and communication infrastructure for AI agent

A perceptual color space for image processing (2020)

Open models have real benefits. Do they outweigh the risks?

Lotus Improv on the NeXT

Show HN: Sgrep; fast, accurate code search for agents

Microsoft Patches More Than 1,400 Security Flaws

Dataset provides blueprint to decode mysteries of the human immune system

Ask HN: How to deal with just being a PR reviewer for LLMs nowadays

Man charged with planting 'sophisticated' recording device in OpenAI office

Browsers are pretty good at loading pages, it turns out

Show HN: DearSQL – A native database client in C++ with Dear ImGui

Reportedly Nvidia stops the production of 5090 GPU

Tmux Hints Inside KRunner

TrellisWM the fractal windows manager for macOS

Thunderbird Alternatives: 7 Best Email Clients to Try in 2026

How to be more ambitious when using AI