Talk:Industrial-grade prime
Latest comment: 16 years ago by PrimeHunter in topic Hardness by digits, a moving target
 | This article has not yet been rated on Wikipedia's content assessment scale. |
Hardness by digits, a moving target edit
Using AKS algorithm you can prove whatever a 100 digit decimal number is prime using a 800MHz Pentium III machine in under a day of machine work (source: On the implementation of AKS-class primality tests. R. Crandall, J. Papadopoulus. Aviable on http://www.apple.com/acg/pdf/aks3.pdf the fragment in question is on p. 8), so the statement about inability to prove the 100digit numbers is incorrect. What's more, the paper suggests that a current (as of the time the paper was written) machine with a highly optimised version of the algorithm could prove whatever a 100000 digit decimal number is prime whithin a day... 213.135.44.135 (talk) 18:34, 19 January 2008
- AKS is actually very slow compared to other methods. ECPP on a modern PC can prove a 100-digit prime in a fraction of a second. The article has problems and I will look at it within a day. PrimeHunter (talk) 23:55, 19 January 2008 (UTC)
- I have worked on the article, removing some material.[1] You can add {{disputed}} again if you dispute the new version. PrimeHunter (talk) 23:28, 20 January 2008 (UTC)