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?

How to Make Something People (Actually) Give a Shit About

The

Simplified Technical English

How Polymarket Works and How to Backtest Prediction Strategies in Python

Show HN: Headroom – warns you before your AI chat starts forgetting

Series or Parallel: the fork that decides hybrid aviation

The Allure and Peril of Riding an Alaskan Wave for Six Miles

Show HN: Swath – parallel S3 listing without knowing the key distribution

AI database chat: ask in plain language, review the query, get answers

Transforms complex documents like PDFs and Office docs into Markdown/JSON

Putting AI Everywhere Does Not Mean Success

Engineers plan to save the satellite sent to save NASA's Swift mission

MiniMax H3 Day-0 Support in ComfyUI: Open Weights, Native Audio, and 2K Video

SPF Record Syntax: Mechanisms, Qualifiers, Modifiers, and Macros

The Red Strings Club

GeoAI: Understanding the New Grammar

Moths That Smell Flowers Through Their Wings

Mastermind of a US Telemedicine Scam Is Enjoying the Luxury Life in Russia

SpaceX wins $1.6B Space Force contract for 18 Falcon 9 launches

Godox Transparent Viewfinder Camera C100

Agent needs a computer, not a container – introducing Cloudflare/computer

Show HN: An open source user feedback widget

Cloudflare Workers and Containers now support inbound TCP connections and gRPC

What Happens Inside a RAG Pipeline

Frame selection is the whole game: notes on making LLMs watch video

Pelles C

Show HN: Having models make roller coasters instead of pelicans (via OpenRCT2)

30 years of CPUs at Tom's Hardware – looking back on three decades of processors

Techie lured out of retirement to support software only he remembered

Base4 – A New Base System for Visualizing Binary