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?

Private Hosted OpenClaw that can connect to your data with included AI models

Show HN: Machine – One VM per Project

Directory of Blogs with a /Now Section

Five LLM agents play Werewolf in-browser, each with a private DuckDB

My Wi-Fi Was Faster Than Ethernet So I Fixed It

An example of functional slop code

Driving

Groww beat every odd to get here. Now what?

AI Poop Analysis App Offered to Sell Me Database of Its Users' Poops

Tesla Solar Roof is on life support as it pivot to panels

In Japan, we don't see robots as a threat: just a form of presence in the world

Danger Testing

Anyone on the Internet Can Ring Your Doorbell

Coal Makes a Comeback, Fueled by War in the Middle East

Grok vs. ChatGPT vs. Gemini Comparison 2026: Complete Guide (Tested)

We refrigerated our way out of needing each other

Achieving last-iterate convergence in a QNN via an autonomous Gmetric driver

Grafana Labs internal source code accessed

Show HN: Serene Bach – a Go weblog engine that runs as CGI or HTTP

Show HN: Brokkr - Scalable cluster management for GPU/HPC workloads

As the West Dries Out, a New Generation of Dams Rise

Learning to Write (Again)

The latest X algorithm has been published to GitHub

A Tale of Two File Names

Refray – ∞-way RW Git sync tool and auto conflict resolution, for leaving GitHub

Recent Developments in LLM Architectures: KV Sharing, MHC, Compressed Attention

I Found Ultra-Pure Quantum Crystals in an Abandoned Mine in the Atacama Desert

We Built a Web That Consumes Us

'News will find me' mindset makes people trust algorithms and online networks

Async I/O in Zig 0.16, today