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?

America's $10T AI infrastructure boom is starting to fray

He Jiankui Affair

JAXA is about to perform a Phobos sample return mission

A Princeton PhD Applied to 2,300 Jobs. He Still Can't Get One

Zero-Click Spyware Is Infecting Phones via Targeted Ads

Encryption Is Getting Squeezed from All Sides

Space Shuttle Endeavour Transport

Algorithmic Similarity and the Limits of Proof: Facial Recognition

The Cycle of New Software: On Operative Simulacra

'What the hell did this?': The orca brothers preying on great white sharks

Want to Release Projects Easily?

Anthropic turns to lawyers to help AI agents strike deals

Show HN: Parents Inbox – Communication Guide for Schools

TurboScribe AI: Free video to text and audio to text converter

China startup demoes prototype EUV light source, still years away from viability

PwnEscape: Guest-to-Host KVM Escape (CVE-2026-99999)

I made an OS kernel in Rust that runs in the browser and on an actual computer

LLMs are inside fabs, so why aren't they solving core problems?

Telegram Web A: Telegram's Zero-Dependency Official Web Client

Show HN: Pbschema-lens – static doc generator for protobuf

The game industry is broken – can we fix it?

World's Timekeepers Vote to Eliminate the Leap Second

Fast approximation algorithms for knapsack problems (1977)

Dot factory – a spec to describe complex (agentic) workflows

Matthew Prince on why Cloudflare offers a free version and always will

Mobile Application GPU Optimization Guide

Rahn Curve

Does moving a GPU server's request loop into the kernel save CPU?

Wing Commander 3 is getting a remaster

AI Slop? Nay, AI Gourmet