Graph Isomorphism was not thought to be NP-hard. In fact, it&#x27;s been a struggle to come up with any hard instances of the problem. If Babai&#x27;s work turns out to be correct, it just confirms that there aren&#x27;t really any hard instances.