# Proof compression and NP versus PSPACE. Part 2

## TL;DR

This paper provides a complete proof confirming the conjecture that NP equals PSPACE, building upon previous work that addressed proof compression and complexity class relationships.

## Contribution

It offers the first complete proof establishing NP = PSPACE, advancing the understanding of proof complexity and computational complexity class equivalences.

## Key findings

- Confirmed NP = PSPACE conjecture
- Extended previous partial results to a complete proof
- Implications for proof compression and complexity theory

## Abstract

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)