While this submission is a draft, it cannot be used by other submissions.

Environment v4.30.0. The archive's epoch is v4.33.0; only submissions in v4.30.0 can cite this work.

Proof of `Two polynomial-time conventions, and their separation` (3rd statement)

groundedproofs/Lax58Proofs/RamPolynomialSeparation.lean · lax-58

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

The all-zero input of a sufficiently large even length admits that same length as a word width, yet its exact exponential output does not fit. This defeats every constant capacity coefficient, regardless of time.