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?

Terminal and Panel Reorganization in RexIDE

Install F-Droid apps over USB straight from the browser

New studies suggest consciousness exists in organisms without brains

I built a WordPress plugin for simple content statistics and stylometry markers

Iranian Guards' business empire to win big if U.S. sanctions lifted

When a Robot Kicks a Child

UK unveils prototype missiles for Ukraine with no US components

A Chin-Stroking Mystery: Why Are Humans the Only Animals with Chins?

VLMs cannot automate construction takeoff. The data is not in the drawings

Updated UI icons on Wikimedia Foundation sites (including Wikipedia)

How Many Words Are in a 5 Minute Speech

The CP-SAT Primer: Using and Understanding Google OR-Tools' CP-SAT Solver

A synthetic order analytics pipeline built on CDC from Postgres to ClickHouse

An experiment in building accounting around financial actions instead of forms

Show HN: CoshUI – A backend-agnostic UI engine for Python game development

The Hardest Kind of Unsafe Rust

Performance Has Layers

The seven methods for delivering instructions

Rust in Production: ClickHouse

Court Transcript Costs

Pappice – a self-hosted support desk in one Go binary

Show HN: Created On-Page SEO Tool – AI Action Plans for Search Console Data

Show HN: APK-interceptor – Android deeplink, Intent assessment helper

Show HN: Local automation runner with built-in LLM steps – YAML pipelines

Show HN: WhatsKept – Searchable,agent-queryable WhatsApp history from iOS backup

Maria Isabel Sánchez Vegara on Her 100th "Little People, Big Dreams" Book

Show HN: F1l0 – Fitness Logger

Data Center Warfare: Defending AI Infrastructure

Show HN: I'm building a free TradingView alternative

Banned