Lax Lean Archive

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` (2nd statement)

groundedproofs/Lax58Proofs/RamExponentialExample.lean · lax-58

What this proof establishes

no assumptions

def✓Lax58.RamPolynomialComparison (2nd statement)

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

Six executed RAM instructions suffice. A sufficient word length is binary input size plus four, which fits the arena, the literal six, and the output.