chore: fix some typos in comments

Signed-off-by: alongdate <alongyear@outlook.com>
pull/4758/head
alongdate 7 months ago committed by Aniket
parent 6e591b6b14
commit 2b551634aa
  1. 6
      libs/remix-ws-templates/src/templates/hashchecker/templates/plonk_verifier.sol.ejs
  2. 6
      libs/remix-ws-templates/src/templates/rln/templates/plonk_verifier.sol.ejs
  3. 6
      libs/remix-ws-templates/src/templates/semaphore/templates/plonk_verifier.sol.ejs

@ -158,7 +158,7 @@ contract PlonkVerifier {
let pAux := mload(0x40) // Point to the next free position let pAux := mload(0x40) // Point to the next free position
let pIn := pVals let pIn := pVals
let lastPIn := add(pVals, mul(n, 32)) // Read n elemnts let lastPIn := add(pVals, mul(n, 32)) // Read n elements
let acc := mload(pIn) // Read the first element let acc := mload(pIn) // Read the first element
pIn := add(pIn, 32) // Point to the second element pIn := add(pIn, 32) // Point to the second element
let inv let inv
@ -174,9 +174,9 @@ contract PlonkVerifier {
} }
acc := inverse(acc, q) acc := inverse(acc, q)
// At this point pAux pint to the next free position we substract 1 to point to the last used // At this point pAux pint to the next free position we subtract 1 to point to the last used
pAux := sub(pAux, 32) pAux := sub(pAux, 32)
// pIn points to the n+1 element, we substract to point to n // pIn points to the n+1 element, we subtract to point to n
pIn := sub(pIn, 32) pIn := sub(pIn, 32)
lastPIn := pVals // We don't process the first element lastPIn := pVals // We don't process the first element
for { } gt(pIn, lastPIn) { for { } gt(pIn, lastPIn) {

@ -158,7 +158,7 @@ contract PlonkVerifier {
let pAux := mload(0x40) // Point to the next free position let pAux := mload(0x40) // Point to the next free position
let pIn := pVals let pIn := pVals
let lastPIn := add(pVals, mul(n, 32)) // Read n elemnts let lastPIn := add(pVals, mul(n, 32)) // Read n elements
let acc := mload(pIn) // Read the first element let acc := mload(pIn) // Read the first element
pIn := add(pIn, 32) // Point to the second element pIn := add(pIn, 32) // Point to the second element
let inv let inv
@ -174,9 +174,9 @@ contract PlonkVerifier {
} }
acc := inverse(acc, q) acc := inverse(acc, q)
// At this point pAux pint to the next free position we substract 1 to point to the last used // At this point pAux pint to the next free position we subtract 1 to point to the last used
pAux := sub(pAux, 32) pAux := sub(pAux, 32)
// pIn points to the n+1 element, we substract to point to n // pIn points to the n+1 element, we subtract to point to n
pIn := sub(pIn, 32) pIn := sub(pIn, 32)
lastPIn := pVals // We don't process the first element lastPIn := pVals // We don't process the first element
for { } gt(pIn, lastPIn) { for { } gt(pIn, lastPIn) {

@ -158,7 +158,7 @@ contract PlonkVerifier {
let pAux := mload(0x40) // Point to the next free position let pAux := mload(0x40) // Point to the next free position
let pIn := pVals let pIn := pVals
let lastPIn := add(pVals, mul(n, 32)) // Read n elemnts let lastPIn := add(pVals, mul(n, 32)) // Read n elements
let acc := mload(pIn) // Read the first element let acc := mload(pIn) // Read the first element
pIn := add(pIn, 32) // Point to the second element pIn := add(pIn, 32) // Point to the second element
let inv let inv
@ -174,9 +174,9 @@ contract PlonkVerifier {
} }
acc := inverse(acc, q) acc := inverse(acc, q)
// At this point pAux pint to the next free position we substract 1 to point to the last used // At this point pAux pint to the next free position we subtract 1 to point to the last used
pAux := sub(pAux, 32) pAux := sub(pAux, 32)
// pIn points to the n+1 element, we substract to point to n // pIn points to the n+1 element, we subtract to point to n
pIn := sub(pIn, 32) pIn := sub(pIn, 32)
lastPIn := pVals // We don't process the first element lastPIn := pVals // We don't process the first element
for { } gt(pIn, lastPIn) { for { } gt(pIn, lastPIn) {

Loading…
Cancel
Save