Prolly Rust Library Released for Content-Addressed Ordered Maps

Introduction to Prolly

The `prolly` Rust library crate has been made available, offering content-addressed prolly tree storage primitives. This library is designed for creating immutable, ordered key-value indexes where both keys and values are byte sequences. Users can integrate the package as `prolly-map`.

Core Functionality

The crate provides a `Tree` handle, which includes a `root` pointing to a content-addressed root node and a `config` detailing chunking and encoding parameters. Operations like `put`, `delete`, and `batch` return a new `Tree` by cloning and rewriting only affected paths or subtrees, writing new content-addressed nodes in the process.

Technical Architecture

All storage-backed tree operations are implemented by a runtime-neutral, async-first engine. `AsyncProlly<S: AsyncStore>` uses this engine directly, while `Prolly<S: Store>` drives operations through an inline ready-only adapter. The synchronous path avoids creating a runtime or dispatching store calls to Tokio.

Additional Resources and Future Directions

Comprehensive documentation, including getting started guides, cookbook recipes, and architectural specifications, is available in the `docs/` directory. The project also includes a browser-based visualizer for mutations and structural diffs. A proposed `prolly-vcs` design aims to build a Git-like repository layer on top of prolly trees, focusing on a separate crate for general backend-neutral `KvStore` functionalities.