NP = PSPACE
arxiv.org
arxiv.org
I'd be willing to bet a lot of money this isn't right. It's hard to convey how implausible it is that NP could equal PSPACE, and the proof strategy is just “Here is an NP algorithm for a PSPACE-complete problem”. They haven't attempted to implement the algorithm, as far as I can see. Presumably if this claim gets enough attention, someone will go to the trouble of working out where the mistake is in the proof.