It&#x27;s true that this is a really, really big theoretical advance, but it has almost <i>zero</i> impact on P vs NP.  It&#x27;s been believed for a long time that graph isomorphism is &quot;close to P&quot; for some suitable definitions.<p>And this story has been discussion here on HN many many times over the past few weeks.<p>So this is a nice article about a seriously major breakthrough, but take all the P vs NP speculation with a huge handful of salt.