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?

Deployment and observability tools for AI agents, scored

SPF Supply Chain 2026: Email Sender Market Share Across 5.5M Domains

Share email tags between KMail and Thunderbird

Splatt3rs: A Splatoon 3 Automatic Mailbox Message Plotter

Show HN: PairOnce – Files between phone and computer, no app needed

Show HN: Komrad – an AI agent that does NOT work for you

Key LLM Inference Metrics Explained in 5 Minutes

Memory Safety Bugs in Rust Standard Library

Show HN: Mandaboard, privacy-focused kindness trove, CBT log and vision board

Gen X will outnumber Baby Boomers in US Congress

Blazly recently pivoted from a marketing SaaS platform to a prompt-only platform

CT Journal

Modernizing NetHack's C engine with .NET MAUI, Avalonia and a 31-tool AI advisor

The Vaccine Divide

Major Canonical Outage

Show HN: Outlier, AI without the data center, private and offline on your Mac

Finding a Vulnerability in Star Wars Episode I: Racer

SafeCurves: Choosing safe curves for elliptic-curve cryptography

The answer to "why is my £775k new build flat so small and crappy?"

.web domain registration expected to open on April 6, 2027

Pulse width modulation on MacBook Pro with PROLED

Open Source HTAP with DBTrail and Percona Server for MySQL

Show HN: Super Agent – Your 7*24 Always-On Agent Team

TSMC Approves $1B AI Investment

Open research, stronger privacy: Making Firefox users harder to fingerprint

Self-Building Labs

Show HN: Kodelyth ECC – 71 AI agents and MCP and 55% token cuts for Claude Code

Australia considers criminal penalties for rogue AI in wake of OpenAI hack

ClankTalk – Sandboxed Scripting for Agents

Can a Linear Program Do Weight-Space Programming?