Comparator<byte[]> comparator2 = UnsignedBytes.lexicographicalComparatorJavaImpl();
    Random rnd = new Random(714958103);
    for (int trial = 0; trial < 100; trial++) {
      byte[] left = new byte[1 + rnd.nextInt(32)];
      rnd.nextBytes(left);
      byte[] right = left.clone();
      assertThat(comparator1.compare(left, right)).isEqualTo(0);

positives for adversarially chosen values. // // isPrime is not constant-time. func isPrime(w []byte) bool { mr, err := millerRabinSetup(w) if err != nil { // w is zero, one, or even. return false } // Before Miller-Rabin, rule out most composites with trial divisions. for i := 0; i < len(primes); i += 3 { p1, p2, p3 := primes[i], primes[i+1], primes[i+2] r := mr.w.Nat().DivShortVarTime(p1 * p2 * p3) if r%p1 == 0 || r%p2 == 0 || r%p3 == 0 { return false } } // iterations is the number of Miller-Rabin rounds,...