chore: add nolint directive to BitReverse

Author: ivokub

backend/plonk/bls12-377/prove.go

@@ -89,7 +89,7 @@ func (f gateFunctionFr) fitPoly(nbIn int, degreeBound uint64) polynomial.Polynom
 
 	// obtain p's coefficients
 	domain.FFTInverse(p, fft.DIF)
-	fft.BitReverse(p)
+	fft.BitReverse(p) //nolint:staticcheck // method is backwards compatible
 	{{- else }}
 	x := make({{.FieldPackageName}}.Vector, degreeBound)
 	x.MustSetRandom()

backend/plonk/bls12-381/prove.go

@@ -895,7 +895,7 @@ func (s *instance) computeNumerator() (*iop.Polynomial, error) {
 	scalingVector := cosetTable
 	scalingVectorRev := make([]fr.Element, len(cosetTable))
 	copy(scalingVectorRev, cosetTable)
-	fft.BitReverse(scalingVectorRev)
+	fft.BitReverse(scalingVectorRev) //nolint:staticcheck // method is backwards compatible
 
 	// pre-computed to compute the bit reverse index
 	// of the result polynomial
@@ -936,7 +936,7 @@ func (s *instance) computeNumerator() (*iop.Polynomial, error) {
 
 			// reuse memory
 			copy(scalingVectorRev, scalingVector)
-			fft.BitReverse(scalingVectorRev)
+			fft.BitReverse(scalingVectorRev) //nolint:staticcheck // method is backwards compatible
 		}
 
 		// we do **a lot** of FFT here, but on the small domain.