chore: more uses of BitReverse

Author: ivokub

backend/plonk/bls12-377/prove.go

@@ -6,6 +6,7 @@ import (
 	"github.com/consensys/gnark/std/gkrapi/gkr"
 	"{{.FieldPackagePath}}"
 	{{- if .CanUseFFT }}
+	gcutils "github.com/consensys/gnark-crypto/utils"
 	"{{.FieldPackagePath}}/fft"
 	"sync"{{- else}}
 	"errors"{{- end }}
@@ -89,7 +90,7 @@ func (f gateFunctionFr) fitPoly(nbIn int, degreeBound uint64) polynomial.Polynom
 
 	// obtain p's coefficients
 	domain.FFTInverse(p, fft.DIF)
-	fft.BitReverse(p)
+	gcutils.BitReverse(p)
 	{{- else }}
 	x := make({{.FieldPackageName}}.Vector, degreeBound)
 	x.MustSetRandom()

backend/plonk/bls12-381/prove.go

@@ -12,6 +12,7 @@ import (
 	"golang.org/x/sync/errgroup"
 
 	"github.com/consensys/gnark-crypto/ecc"
+	gcutils "github.com/consensys/gnark-crypto/utils"
 	{{ template "import_curve" . }}
 	{{ template "import_fr" . }}
 	{{ template "import_fft" . }}
@@ -895,7 +896,7 @@ func (s *instance) computeNumerator() (*iop.Polynomial, error) {
 	scalingVector := cosetTable
 	scalingVectorRev := make([]fr.Element, len(cosetTable))
 	copy(scalingVectorRev, cosetTable)
-	fft.BitReverse(scalingVectorRev)
+	gcutils.BitReverse(scalingVectorRev)
 
 	// pre-computed to compute the bit reverse index
 	// of the result polynomial
@@ -936,7 +937,7 @@ func (s *instance) computeNumerator() (*iop.Polynomial, error) {
 
 			// reuse memory
 			copy(scalingVectorRev, scalingVector)
-			fft.BitReverse(scalingVectorRev)
+			gcutils.BitReverse(scalingVectorRev)
 		}
 
 		// we do **a lot** of FFT here, but on the small domain.