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

docs: update terminology

Browse Source
This commit is contained in:
Magamedrasul Ibragimov
2022-10-08 16:27:03 +03:00
parent 08b757f761
commit d3d8a5afe3
2 changed files with 7 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/sss.md
View File

@@ -55,7 +55,7 @@ where zero coefficient \\(a_0 = S\\), and \\(a_1\\) is some random number (f.e.
So, the shares are: \\((5, 55), (8, 70), (16, 110)\\)
### Recovering
We can take any two shares to recover (as it was described in the interpolation section) the "secret" polynomial. Zero coefficient (\\(a_0\\)) is the secret \\(S\\).
We can take any two shares to recover (as it was described in the interpolation section) the "secret" polynomial. Zero coefficient (\\(a_0\\)) in the recovered polynomial is the secret \\(S\\).
## Important notes
Arithmetic in this topic is usual for us. However, in the real life **SSS** arithmetic is defined over some finite field. This means that all calculations are carried out modulo some big prime number (in fact, it happens by itself in the Circom, because the arithmetic there is defined over the finite field too, so we don't need to do nothing for that).

14
src/terminology.md
View File

@@ -3,15 +3,13 @@
Term | Description
---- | -----------
zkSNARK | Proof construction where one can prove possession of certain information, e.g. a secret key, without revealing that information, and without any interaction between the prover and verifier.
Circuit | A program, that describes constraints for the prover in zkSNARK (for more information read [this](https://medium.com/@VitalikButerin/quadratic-arithmetic-programs-from-zero-to-hero-f6d558cea649)).
zk-Gadget | Circuit, that can be used as a building block for another circuit, e.g. Poseidon hash function gadget.
Stake | Financial or social stake required for registering in the RLN applications. Common stake examples are: locking cryptocurrency (financial), linking reputable social identity.
Identity secret | An array of two unique random components (identity nullifier and identity trapdoor), which must be kept private by the user. Secret hash and identity commitment are derived from this array.
Identity nullifier | Random 32 byte value used as component for identity secret generation.
Identity trapdoor | Random 32 byte value used as component for identity secret generation.
Identity secret hash | The hash of the identity secret, obtained using the Poseidon hash function. It is used for deriving the identity commitment of the user, and as a private input for zk proof generation. The secret hash should be kept private by the user.
Identity commitment | Hash obtained from the Identity secret hash by using the poseidon hash function. It is used by the users for registering in the protocol.
Identity secret | Random number, which must be kept private by the user.
Identity commitment | The result of Poseidon(Identity secret) calculation. It is used by the users for registering in the protocol.
Signal | The message generated by a user. It is an arbitrary bit string that may represent a chat message, a URL request, protobuf message, etc.
Signal hash | Keccak hash of the signal, used as an input in the RLN circuit.
Signal hash | Hash of the signal, used as an input in the RLN circuit.
RLN Identifier | Random finite field value unique per RLN app. It is used for additional cross-application security. The role of the RLN identifier is protection of the user secrets being compromised if signals are being generated with the same credentials at different apps.
RLN membership tree | Merkle tree data structure, filled with identity commitments of the users. Serves as a data structure that ensures user registrations.
Merkle proof | Proof that a user is member of the RLN membership tree.
zk-gadget |
Merkle proof | Proof that a user is member of the RLN membership tree.