AtHeartEngineer/rln-docs
1
0
Fork 0
mirror of https://github.com/Rate-Limiting-Nullifier/rln-docs.git synced 2026-01-09 15:28:03 -05:00
Code Issues Packages Projects Releases Wiki Activity

Him->Them

Browse Source
This commit is contained in:
AtHeartEngineer
2022-10-07 01:32:02 -05:00
committed by GitHub
parent 7d20a4a895
commit 61900ff303
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/protocol_spec.md
View File

@@ -36,7 +36,7 @@ Thus, if the same epoch user sends more than one message, their polynomial and,
Of course, we somehow must prove that our `share = (x, y)` is valid (that this is really a point on our `polynomial = A(x)`), as well as we must prove other things are valid too, that's why we use zkSNARK. An explanation of the zk-circuits can be found in the next topic.
## Slashing
As it's been said, if a user sends more than one message, everyone else will be able to recover his secret, slash him and take his stake.
As it's been said, if a user sends more than one message, everyone else will be able to recover his secret, slash them and take their stake.
## Some important notes
There are also `nullifier` and `rln_identifier`, which can be found in the **RLN** protocol/circuits.