From a0d3c17ff04f9d9ea54072ac1360ef7d0a5a5fad Mon Sep 17 00:00:00 2001 From: Martin Thomson Date: Fri, 9 Aug 2024 15:15:09 +1000 Subject: [PATCH] More subscripts, etc.. --- draft-savage-ppm-3phm-mpc.md | 10 +++++++--- 1 file changed, 7 insertions(+), 3 deletions(-) diff --git a/draft-savage-ppm-3phm-mpc.md b/draft-savage-ppm-3phm-mpc.md index cd2aa4c..ed0ddeb 100644 --- a/draft-savage-ppm-3phm-mpc.md +++ b/draft-savage-ppm-3phm-mpc.md @@ -884,8 +884,8 @@ generated onto a field element as follows: ~~~ pseudocode commitment = SHA256( concat( - SHA256([G(x)]_-), - SHA256([G(x)]_+) + SHA256([G_-(x)]), + SHA256([G_+(x)]) ) ) r = (bytes2int(commitment[..16]) % (prime - L)) + L @@ -905,7 +905,11 @@ Note that one verifier does not need to receive their shares of `G(x)` from the prover, so they are able to compute their hash before even starting any computation. -Consequently, though each round depends on communication, the total latency is two rounds. In the first, the prover sends shares of G(x) to the left verifier. Concurrently, the right verifier sends a hash of their shares to the left verifier. In the second round, the left verifier sends a hash of their shares to the right verifier. +Consequently, though each round depends on communication, the total latency is +two rounds. In the first, the prover sends shares of `G(x)` to the left +verifier. Concurrently, the right verifier sends a hash of their shares to the +left verifier. In the second round, the left verifier sends a hash of their +shares to the right verifier.