Computer Scientists Are Stunned by This Chicago Professor’s New Proof

It's true that this is a really, really big theoretical advance, but it has almost zero impact on P vs NP. It's been believed for a long time that graph isomorphism is "close to P" for some suitable definitions.

And this story has been discussion here on HN many many times over the past few weeks.

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.

Extensive discussion from 3 days ago:

https://news.ycombinator.com/item?id=10731022