Track the 2002 discovery of the AKS primality test, a deterministic polynomial-time algorithm for determining if a number is prime, finally placing primality testing within the complexity class P.
I’m following the discovery of a polynomial-time primality test by researchers at IIT-K. If proven, this breakthrough challenges the core assumptions of RSA cryptography and might force us to rethink digital security protocols entirely.
I explain why Tetris is NP-Hard by defining P and NP complexity classes in plain English. I use simple analogies like addition and primality testing to show how computational difficulty scales as problems grow larger.
I've shared an update on the groundbreaking prime factorization algorithm developed at IIT Kanpur. The linked Science News report explores the discovery's impact on computational number theory and its significance for modern cryptographic security.
I live east of the Prime Meridian and cross into the western hemisphere daily during my commute through Stratford to Liverpool Street. I reflect on the geographical coordinates of my route and spots like Meridian Square.
I found a fascinating project called "The Secret Lives of Numbers," which used Google search results to catalog the frequency of every integer up to one million, visualizing numerical popularity and patterns across the web.