From d4bae3eddf45ce9ebeaf983312794a60742a1c71 Mon Sep 17 00:00:00 2001 From: William Banfield <4561443+williambanfield@users.noreply.github.com> Date: Fri, 15 Apr 2022 23:14:20 -0400 Subject: [PATCH] Update docs/rfc/rfc-018-bls-agg-exploration.md Co-authored-by: M. J. Fromberger --- docs/rfc/rfc-018-bls-agg-exploration.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/rfc/rfc-018-bls-agg-exploration.md b/docs/rfc/rfc-018-bls-agg-exploration.md index 7082de15a..c6a903ee4 100644 --- a/docs/rfc/rfc-018-bls-agg-exploration.md +++ b/docs/rfc/rfc-018-bls-agg-exploration.md @@ -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.