Summary: Prolly is a content-addressed ordered map implemented in Rust using prolly trees, offering applications immutable snapshots, cheap branching, structural sharing, and efficient diffs and merges. It supports pluggable storage engines like memory, SQLite, and RocksDB, alongside native async support for various databases. The project provides comprehensive primitives for building Git-like version control, secondary indexes, and vector-backed proximity maps.
Tip / Trick Use KeyBuilder for Composite Keys
Utilize KeyBuilder to construct segment-safe composite keys and prefix_range to scan ordered byte-key lookups efficiently since keys sort lexicographically.
Tip / Trick Leverage Parallel Bulk Builders
Use parallel bulk builders for constructing large initial trees efficiently instead of inserting items sequentially.
Project Opportunity ProllyTree GraphQL Gateway
The Problem / Pain Point:
Exposing prolly-backed versioned maps and Git-like data structures over standard web APIs requires manually writing glue code for each application schema.
Proposed Solution:
An auto-generating GraphQL/REST gateway that maps schema definitions directly to Prolly tree operations, enabling instant versioned APIs with historical diffs and branching.
Vibe Coding Feasibility:
High, because AI excels at writing boilerplate-heavy schema-mapping layers and API integrations over existing well-typed Rust libraries.