202F          ; disallowed_STD3_mapped ; 0020          # 3.0  NARROW NO-BREAK SPACE
2030..2032    ; valid                  ;      ; NV8    # 1.1  PER MILLE SIGN..PRIME
2033          ; mapped                 ; 2032 2032     # 1.1  DOUBLE PRIME
2034          ; mapped                 ; 2032 2032 2032 #1.1  TRIPLE PRIME

Peter Hawkins, Pham Binh, Phani Paladugula, Philipp Hack, Praneeth Mandala, Praveen Batra, psinfinity, Qingwei Zhang, Quentin Khan, Quoc Truong, QZero, Rachel Han, Raffi Khatchadourian, Ram Rachum, RasheedAli-Shaik, Raviteja Gorijala, Reed Wanderman-Milne, Reilly Grant, Renjie Wu, Richard Levasseur, Robert David, Ryan M. Lefever, Sachin M, Sagun Bajra, Sai Ganesh Muthuraman, Saksham Singh Rathore, Sannidhya Chauhan, Sayan Saha, Sean Talts, Seher Ellis, Sergei Lebedev, Sergey Kozub, Sevin Fide Varoglu,...

isPrime(b) { return b, nil } } } // isPrime runs the Miller-Rabin Probabilistic Primality Test from // FIPS 186-5, Appendix B.3.1. // // w must be a random odd integer greater than three in big-endian order. // isPrime might return false 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 len(B) < len(W) { B = "0" + B } mr, err := millerRabinSetup(decodeHex(t, W)) if err != nil { t.Logf("W = %s", W) t.Logf("B = %s", B) t.Fatalf("failed to set up Miller-Rabin test: %v", err) } result, err := millerRabinIteration(mr, decodeHex(t, B)) if err != nil { t.Logf("W = %s", W) t.Logf("B = %s", B) t.Fatalf("failed to run Miller-Rabin test: %v", err) } if result != expected { t.Logf("W = %s", W) t.Logf("B = %s", B) t.Fatalf("unexpected result: got %v, want %v", result, expected) } }) default:...