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?

EvoForest-WM: Discovered Neuro-Symbolic World Model for Multivariate Time-Series

Anthropic says Alibaba illicitly extracted Claude AI model capabilities

Show HN: Docket Fleet – mobile device cloud

Japan's AI goldrush faces backlash as data centers sprout up in urban areas

M5StackChan AI Desktop Robot

Aurora Loom, luminous 3D strands woven into a living Aurora

Code as Agent Harness

Free UX Review for websites, web apps and mobile apps

A CVE Dispute

Show HN: Mcplexer.com

Why can't online purchases be as easy as point-of-sale purchases?

Spatially distributed complex organic matter detected in Mars crater

Al-1.0 – A lightweight attribution logging engine for transformers

Show HN: DesktopMCP – Let AI See and Operate your Linux desktop

Introduction to the DOM for Vulnerability Researchers

A magnitude 6.9 earthquake has struck near Iwate Pref Japan

ZKP-Vault: Cryptographic Session Gating and Data Center Optimization

I'm Not a Cat

I Am the Spark, the Bellows, and the Quench

The year is 2063 and you were never interesting

Omnigent: Open-source meta harness for agents

PostgreSQL Is Enough

Steam Machine: Official Overview and Quick Start Guide [video]

Show HN: RealTube – Watch YouTube with filters for AI-generated content

Cloudflare teams up with big browsers to help websites detect unwelcome visitors

Colorado Startup Week Call for Sessions 2026

Why communities struggle to change [video]

Food Delivery Killed Competition (and Your Budget) [video]

Stochastics

Chinese Supercomputer Overtakes U.S. as World's Fastest