v1.0.0

First version of the Proximity Order Trie library is out!

The POT library provides an efficient, context-aware data structure for storing and retrieving key-value pairs based on their proximity order. It supports scalable and cancellable recursive operations. The library includes:

• High-performance trie operations: insert, update, find, and iterate.
• Support for context-based cancellation and deadlines throughout all core and recursive operations.
• Flexible interfaces for custom storage backends, including Swarm network integration.
• Solidity smart contracts for cryptographic proof verification of trie entries, enabling on-chain validation.
• Comprehensive test coverage and integration.