Assuming (the unlikely scenario) that the Polynomial Hierarchy collapses to second level. Thus, $\Sigma_2^p=PSPACE$.
How significant this result would be (broad consensus) as compared to the other open problems in TCS (the most important two being $P$ vs $NP$ and $NP$ vs $coNP$).
Most of the sources rightly point to the above two problems being the most important but despite most of the classes in complexity hierarchy falling under $PSPACE$, I am somewhat surprised not much has been discussed about it.
Is it something that is at the Turing Award or Breakthrough Prize level?