A TypeScript implementation of a Prolly Tree (Probabilistic B-Tree), a content-addressed data structure that provides history-independent, verifiable storage for key-value data.
Python bindings for ProllyTree - a probabilistic tree for efficient storage and retrieval
A prolly (probabilistic) tree for efficient storage, retrieval, and modification of ordered data.