The claimed Verifier Trade-off Theorem is not proven; the valid core reduces to the standard exhaustive-enumeration bound that any b-bit verifier implies a 2^b g(n) solver.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A Verifier Hierarchy
The claimed Verifier Trade-off Theorem is not proven; the valid core reduces to the standard exhaustive-enumeration bound that any b-bit verifier implies a 2^b g(n) solver.