This Trie can be used to represent state in Blockchain systems.
- Hashing-agnostic design would be preferred. Hasher Impl will benefit the design.
- ZK-friendly optimization features, starting with a Risc0 Hashing optimization feature.
- Collision handler
- Write comprehensive tests
- Benchmark time and space complexity
- Decrease depth by merging Nodes
- Store leafs in the DB with Key and store a Reference to these leafs in the populated Branches
- Store modified leafs and branches in memory and re-hash them once insert concluded