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?

We Built Uncatalogued with Rust and Raycast 3D for the Game Boy Advance

Malware uses LLMs to rank victims by how much they're worth

Gemini Code vs. Claude Code – A cautionary post-mortem ($800 in 12h)

Open and Closed Loop Benchmarking

Reddit to lock content behind logins to fight scrapers

The Future of the Firm

An AI Agent Injected Drugs into a Live Mouse's Brain

College will only cost $20 a month

Why VPNs Are Worth Defending

Show HN: Enclyra – 3-4B local models that do real work on an 8 GB Mac, offline

An Attack Vector No One Talks About

Shaun Maguire on X: "People don't understand SpaceX" / X

How Trump Is Dismantling America's Scientific Research Machine

Gta.js, a reimplementation of the 1997 GTA engine in JavaScript and WebGL

The dangerous science behind the Queen of Crime

Mastodon 5.0: A Closer Look

Sysinfo: Fixing performance to retrieve process GPU usage

MoneyPouch – self hosted expense tracker

Goal Pilot AI – Turn goal into AI-generated daily action plans

We've Stopped Dreaming

Bitcoin Core discloses TCP out-of-memory vulnerability

The AI cost of JavaScript frameworks

Using Video Games to Teach Kepler's Laws and Orbital Dynamics

ChemEZ: LLM Wrapper with Chemistry Processing and Visualization

GBench: DeepMind open-sources evaluation suite with 86 benchmark suites

Download macOS Tahoe 26.7.2 installer directly from Apple

Download Xcode Without App Store

Counting women: Why sex‑based data still matters

The Ocean 'Was the Color of Chocolate.' Mexico Declares War on Seaweed.

DeepSeek open-sources dsh-superagent, a coding agent largely built by agents