fix: spellchecker (#1359)

Co-authored-by: Gautam Botrel <[email protected]>
Consensys · Dec 20, 2024 · f95e115 · f95e115
1 parent a8d86e5
commit f95e115
Show file tree

Hide file tree

Showing 3 changed files with 3 additions and 3 deletions.
diff --git a/std/math/emulated/emparams/emparams.go b/std/math/emulated/emparams/emparams.go
@@ -313,7 +313,7 @@ type STARKCurveFr struct{ fourLimbPrimeField }
 
 func (fp STARKCurveFr) Modulus() *big.Int { return ecc.STARK_CURVE.ScalarField() }
 
-// Mod1e4096 provides type parametrization for emulated aritmetic:
+// Mod1e4096 provides type parametrization for emulated arithmetic:
 //   - limbs: 64
 //   - limb width: 64 bits
 //

diff --git a/std/math/emulated/field_assert.go b/std/math/emulated/field_assert.go
@@ -108,7 +108,7 @@ func (f *Field[T]) IsZero(a *Element[T]) frontend.Variable {
 	// in this case the result can be either 0 or p (if it is zero).
 	//
 	// so we check that the reduced value limbs are either all zeros or
-	// corrspond to the modulus limbs.
+	// correspond to the modulus limbs.
 	ca := f.Reduce(a)
 	p := f.Modulus()
 

diff --git a/std/permutation/poseidon2/poseidon2.go b/std/permutation/poseidon2/poseidon2.go
@@ -147,7 +147,7 @@ func (h *Hash) sBox(api frontend.API, index int, input []frontend.Variable) {
 // (4 6 1 1)
 // (1 3 5 7)
 // (1 1 4 6)
-// on chunks of 4 elemts on each part of the buffer
+// on chunks of 4 elements on each part of the buffer
 // see https://eprint.iacr.org/2023/323.pdf appendix B for the addition chain
 func (h *Hash) matMulM4InPlace(api frontend.API, s []frontend.Variable) {
 	c := len(s) / 4