arnaucube/Nova
1
0
Fork 0
mirror of https://github.com/arnaucube/Nova.git synced 2026-01-12 00:51:28 +01:00
Code Issues Projects Releases Wiki Activity

Fix comment typo (#192)

Browse Source
This commit is contained in:
JunheeLee
2023-07-07 02:33:38 +09:00
committed by GitHub
parent 0664244482
commit ba06404736
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/spartan/mod.rs
View File

@@ -357,7 +357,7 @@ impl<G: Group, EE: EvaluationEngineTrait<G, CE = G::CE>> RelaxedR1CSSNARKTrait<G
)); ));
// We will now reduce a vector of claims of evaluations at different points into claims about them at the same point. // We will now reduce a vector of claims of evaluations at different points into claims about them at the same point.
// For example, eval_W =? W(r_y[1..]) and eval_W =? E(r_x) into // For example, eval_W =? W(r_y[1..]) and eval_E =? E(r_x) into
// two claims: eval_W_prime =? W(rz) and eval_E_prime =? E(rz) // two claims: eval_W_prime =? W(rz) and eval_E_prime =? E(rz)
// We can them combine the two into one: eval_W_prime + gamma * eval_E_prime =? (W + gamma*E)(rz), // We can them combine the two into one: eval_W_prime + gamma * eval_E_prime =? (W + gamma*E)(rz),
// where gamma is a public challenge // where gamma is a public challenge

2
src/spartan/sumcheck.rs
View File

@@ -43,7 +43,7 @@ impl<G: Group> SumcheckProof<G> {
} }
// we do not need to check if poly(0) + poly(1) = e, as // we do not need to check if poly(0) + poly(1) = e, as
// decompress() call above already ensures that hods // decompress() call above already ensures that holds
debug_assert_eq!(poly.eval_at_zero() + poly.eval_at_one(), e); debug_assert_eq!(poly.eval_at_zero() + poly.eval_at_one(), e);
// append the prover's message to the transcript // append the prover's message to the transcript