Click Run Tests and watch Baillie-PSW verify against known primes in real time. Every result is computed right here — no server, no tricks.
0Errors found
Running tests...
Test 1 — Edge Cases & Small Numbers
0, 1, 2, 3, 4, negative numbers, first 30 primes
Waiting
Progress0%
Waiting to start...
—Passed
—Failed
—Time
—Accuracy
Test 2 — Carmichael Numbers
Pseudoprimes that fool simple Fermat tests — Baillie-PSW must reject them all
Waiting
Progress0%
Waiting to start...
—Passed
—Failed
—Time
—Accuracy
Test 3 — Complete Verification 0 to 500,000
Every integer — compared against reference Sieve of Eratosthenes
Waiting
Progress0%
Waiting to start...
—Passed
—Failed
—Time
—Accuracy
Test 4 — Large Known Primes
Verified primes up to 10⁵⁰ — including our discovery
Waiting
Waiting to start...
—Passed
—Failed
—Time
—Accuracy
Test 5 — The Google AI Challenge
Google AI said 10⁵⁰+151 is composite. We disagree.
Waiting
✗ Google AI said
"Divisible by 11. Composite number."
Error: alternating digit sum calculated on 4 digits only — ignored 47 zeros.
✓ NextPrime says
Pending test...
Waiting to start...
—N mod 11
—Miller-Rabin
—Lucas test
—Time (ms)
Results
All tests complete.
Test
Cases
Errors
Accuracy
Time
Status
Conclusion
Baillie-PSW + Wheel 210 produces zero errors across all tested cases.
The algorithm is deterministic for all inputs — no known counterexample exists for any value of N.