mirrors/tendermint
1
0
Fork 0
mirror of https://github.com/tendermint/tendermint.git synced 2026-08-28 03:46:33 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update docs/rfc/rfc-018-bls-agg-exploration.md

Browse Source 
Co-authored-by: M. J. Fromberger <fromberger@interchain.io>
This commit is contained in:
William Banfield
2022-04-15 23:14:20 -04:00
committed by GitHub
co-authored by M. J. Fromberger
parent c87cab4ff6
commit d4bae3eddf
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/rfc/rfc-018-bls-agg-exploration.md
+1 -1
View File
@@ -46,7 +46,7 @@ and verifying that a given solution is correct.
Pairing-based cryptography works by operating on mathematical functions that
satisfy the property of 'bilinear mapping'. This property is satisfied for
functions `e` with values `P`, `Q`, and `R` where `e(P, Q + R) = e(P, Q) * e(P, R)`
functions `e` with values `P`, `Q`, and `R` where `e(P, Q + R) = e(P, Q) + e(P, R)`
and `e(P + Q, R) = e(P, R) * e(Q, R)`. The most familiar example of this is
exponentiation. Written in common notation, P^(Q+R) = P^Q * P^R.