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?

GovScape lets you easily search government documents

Fable 5 up to 50% of weekly usage limits through July 7

Otsuka posts phase 3B ADHD trial win ahead of looming FDA approval decision

Underwater Suit-Wearing Cyborg Insect Capable of Hours-Long Divingl

U.S. murder rate approaches a record low

Claude Fable 5 available globally tomorrow

Ask HN: If governments keep restricting frontier AI, what happens next?

The Oracle Problem

Is Claude's Constitution Aligned with Planetary Flourishing?

Scientists discover unexpected way to make pancreatic cancer cells self-destruct

Tracing Codex's 640TB-a-year SQLite writes

Syncpen: A Markdown writing app your AI can write in (Claude, Cursor, Cowork)

WhatsApp Coding – Managing Google Antigravity 2.0 via a mobile chat proxy

Modular Cognitive Architecture Emerges in Large Language Models

BullRun – free global stock screener with an MCP server

Firms that adopt AI grow headcount 10% over the two years following adoption

What ORMs have taught me: just learn SQL (2014)

Why do teams keep losing context, and why hasn't any tool fixed it?

Trump's second-term windfall: $1.4B

Vektor Slipstream v1.7.4: Effort Control and Real Memory Search

The Virtual Drug That Created Fortnite

Chinese tech makes desalinating seawater cheaper than producing bottled water

IBM claims first sub-1 nanometer chip technology

A new Plaza Accord for global currencies wouldn't work

Ireland is big tech's lapdog – and that compromises its EU presidency

Single header Parser Combinators for C

The fat cats of state government

Vinton Cerf Is Retiring from Google

Leash: Browser Without URL Bar

Russia's plan to drill in Arctic revives controversial theory of 'endless oil'