drewstone
drewstone
# Alternative method Instead of merkle-izing everything, we still use the set-membership proof at the end (the set of merkle roots of other chains) and then we hash this before...
### Setting Consider a bridge with $N$ anchors. Each anchor then stores additionally its $N-1$ neighboring merkle roots. Each anchor stores $K$ merkle trees. This is the setting for all...
The gas costs we can assume are roughly fixed for witnesses (they can be as large as we want w/ Groth16, Plonk it scales probably in the size of #...
I think the bigger question is whether we want to slash balances/staked amounts @1xstj. I think we'll need to model out the system and discuss this more eventually.
### Comments on line items 2. This is not needed nor is it smart to do imo. Peers should not need to know what round other peers are on. Also,...
Another things to take into account. Say there are 3 authorities (A, B, C). If authorities A, B, manage to make it round _**i+1**_ after round _**i**_, I think it...
Linking closed PR for provenance: https://github.com/webb-tools/dkg-substrate/pull/403
- How do you identify when a trial hasn’t finished successfully? - How do you select sets? Is it the same ordering each time or is there randomized selection? How...
https://aws.amazon.com/blogs/security/confidential-computing-an-aws-perspective/
@thomivy we should consider structuring this as a grant.