chore: use *big.Int (convention)

Consensys · Sep 27, 2023 · f6e00f8 · f6e00f8
1 parent 045e256
commit f6e00f8
Show file tree

Hide file tree

Showing 2 changed files with 2 additions and 2 deletions.
diff --git a/internal/generator/ecdsa/template/marshal.go.tmpl b/internal/generator/ecdsa/template/marshal.go.tmpl
@@ -136,7 +136,7 @@ func (sig *Signature) SetBytes(buf []byte) (int, error) {
 	// S, R < R_mod (to avoid malleability)
 	frMod := fr.Modulus()
 	zero := big.NewInt(0)
-	var bufBigInt big.Int
+	bufBigInt := new(big.Int)
 	bufBigInt.SetBytes(buf[:sizeFr])
 	if bufBigInt.Cmp(zero) == 0 {
 		return 0, ErrZero

diff --git a/internal/generator/edwards/eddsa/template/marshal.go.tmpl b/internal/generator/edwards/eddsa/template/marshal.go.tmpl
@@ -119,7 +119,7 @@ func (sig *Signature) SetBytes(buf []byte) (int, error) {
 	// P_mod = field of def of the twisted Edwards = Fr snark field
 	fpMod := fr.Modulus()
 	zero := big.NewInt(0)
-	var bufBigInt big.Int
+	bufBigInt := new(big.Int)
 	bufCopy := make([]byte, fr.Bytes)
 	for i := 0; i < sizeFr; i++ {
 		bufCopy[sizeFr-1-i] = buf[i]