You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Create a minimal noir implementation that supports a "slow updates" tree which can be "read" and updated from public and private.
The implementation should support both member-ship and non-membership proofs.
The initial plan is to just use a sparse tree to make this easy to implement, but this will bring us very close to the limit on number of inputs, so for any practical use, we will need to implement the oracles mentioned in #1291.
The text was updated successfully, but these errors were encountered:
Fixes#2801. (Also fixes#3214)
Experimentation with slow updates in Noir.
- Adds a slow update structure
- Sparse tree to support membership and non-memberships
- Wraps this structure in a contract to make interaction easier
- Adds an oracle to make it practical to pass the >200 params.
- Implement token contract with blacklist and access control in the slow
tree.
Create a minimal noir implementation that supports a "slow updates" tree which can be "read" and updated from public and private.
The implementation should support both member-ship and non-membership proofs.
The initial plan is to just use a sparse tree to make this easy to implement, but this will bring us very close to the limit on number of inputs, so for any practical use, we will need to implement the oracles mentioned in #1291.
The text was updated successfully, but these errors were encountered: