Computational complexity and proof systems constitute a cornerstone of theoretical computer science, addressing both the inherent difficulty of algorithmic problems and the efficiency of formal ...