Hi!, i have invented O(1) algorithm for checking if number is prime that works in 95%+ cases. For more details checkout comments for link to the github repo

[text] 6 v bool isprimeint x Vi return false test no.99989 passed test no.99990 passed test no.99991 failed S I CEE PR B R test no.99993 passed test n0.99994 passed test no.99995 passed S O CEE P R test n0.99997 passed test no.99998 passed test n0.99999 passed 95.121 tests passed