Update README.md

This commit is contained in:
Daniel Lamberger 2024-01-17 12:25:12 +02:00 committed by GitHub
parent 2310308663
commit 4fa0d61aa8
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 3 additions and 3 deletions

View File

@ -12,15 +12,15 @@ in the Nim programming language, to be integrated into the [Nimbus project](http
## Banderwagon commitments
- [ ] Implement the logic by making use of [IPA Multipoint](https://github.com/crate-crypto/ipa_multipoint) / [Banderwagon](https://github.com/crate-crypto/banderwagon) / [blst](https://github.com/supranational/blst)
- [X] Implement the logic by making use of [IPA Multipoint](https://github.com/crate-crypto/ipa_multipoint) / [Banderwagon](https://github.com/crate-crypto/banderwagon) / [blst](https://github.com/supranational/blst)
- [ ] Create tests focusing on the integration between the high-level Nim code and libraries, e.g. big/little endian issues
## Verkle tree implementation
- [X] Implement the Verkle tree structure, with basic operations (e.g. adding nodes)
- [ ] Support computation of commitments / proofs. Possibly, cache them in the tree.
- [ ] Support tree mutation with minimal recomputation of commitments
- [X] Support computation of commitments / proofs. Possibly, cache them in the tree.
- [X] Support tree mutation with minimal recomputation of commitments
- [ ] Create tests, focusing on edge cases (empty tree, sparse tree, dense tree, consistency after mutations). Possibly use fuzzing with deterministic random, as done in [rust-verkle](https://github.com/crate-crypto/rust-verkle/blob/master/verkle-trie/tests/trie_fuzzer.rs).
- [ ] Create comparative tests between the various Verkle implementations; given an identical tree, identical commitments are expected
The compatibility/ folder contains git submodules of other verkle implementations, extended with compatibility tests. See: