What is the complexity theoretic status of P vs NP, ETH, and Graph Isomorphism?

Question

The Graph Isomorphism problem (GI) was shown by Babai to be subexponential. Therefore, the possibility that GI is NP-complete is inconsistent with the exponential time hypothesis

The answers provide the remaining mutually exclusive possibilities for the questions of whether:

P = NP

ETH is true

GI is NP-Complete

GI in P

Manifold Markets · Answer

Per Manifold Markets prediction market, P != NP, ETH false, GI in P, followed by P != NP, ETH false, GI NP-intermediate and P = NP are most likely. See the market for live updates (14 traders, as of Nov 1, 2026).