if r != needle {
				rs = append(rs, r)
			}
		}
	}
	// Shuffle the runes so that they are not in descending order.
	// The sort is deterministic since this is used for benchmarks,
	// which need to be repeatable.
	rr := rand.New(rand.NewSource(1))
	rr.Shuffle(len(rs), func(i, j int) {
		rs[i], rs[j] = rs[j], rs[i]
	})
	uchars := string(rs)

	return func(b *testing.B, n int) {

pkg syscall, type SysProcAttr struct
pkg syscall, type Timespec struct
pkg syscall, type Timeval struct
pkg syscall, var ForkLock sync.RWMutex
pkg syscall, var SocketDisableIPv6 bool
pkg testing, func Benchmark(func(*B)) BenchmarkResult
pkg testing, func Main(func(string, string) (bool, error), []InternalTest, []InternalBenchmark, []InternalExample)
pkg testing, func RunBenchmarks(func(string, string) (bool, error), []InternalBenchmark)

func BenchmarkCAST(b *testing.B) { // IG 10.3.A says "ML-DSA digital signature generation CASTs should cover // all applicable rejection sampling loop paths". For ML-DSA-44, there are // four paths. For ML-DSA-65 and ML-DSA-87, only three. This benchmark helps // us figure out which is faster: four rejections of ML-DSA-44, or three of // ML-DSA-65. (It's the former, but only barely.) b.Run("ML-DSA-44", func(b *testing.B) { // Same as TestACVPRejectionKAT/Test/Path/ML-DSA-44/1. seed := fromHex("5...

B(&x, B, &y) q1.ScalarBaseMult(&x) q2.ScalarBaseMult(&y) check.Add(&q1, &q2) checkOnCurve(t, &p, &check, &q1, &q2) return p.Equal(&check) == 1 } if err := quick.Check(varTimeDoubleBaseMul, quickCheckConfig(32)); err != nil { t.Error(err) } } // Benchmarks. func BenchmarkScalarBaseM(b *testing.B) { var p Point for i := 0; i < b.N; i++ { p.ScalarBaseMult(dalekScalar) } } func BenchmarkScalarMult(b *testing.B) { var p Point for i := 0; i < b.N; i++ { p.ScalarMult(dalekScalar, B) } } func BenchmarkVarTimeDoub(b...