Constructive binary modular execution and power correctness — Exact Proof Explorer

Nineteen independently checked constructive theorems build complete square-and-multiply traces for any supplied valid beta-coded digit prefix, prove the exact Horner/exponent power invariant, and give a unique result.

19 theorem bodies · 60 proof edges · 794 tactic lines · 5 layers

Alpha v34 checked-use · first admitted v22 · independently kernel and Lean verified; not Stable

Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.

19 theorems
01234
BE0001 · binary_digit_prefix_empty

Every empty beta-coded prefix is constructively a valid binary digit sequence.

layer 0 · 16 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE0002 · binary_digit_prefix_restrict

Every valid successor-length binary digit prefix has a valid predecessor prefix.

layer 0 · 16 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE0003 · binary_digit_prefix_terminal_bit

Every nonempty valid beta-coded binary prefix has a genuine final zero-or-one digit.

layer 0 · 19 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE0004 · binary_execution_initial_state

There is a real beta code whose initial square-and-multiply accumulator is one.

layer 0 · 8 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE0005 · binary_execution_step_digit

Every actual modular square-and-multiply transition explicitly carries a binary digit.

layer 0 · 13 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE0006 · binary_execution_power_zero

For every guarded modulus, the actual initial accumulator one is the canonical zeroth power.

layer 0 · 30 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE0007 · binary_execution_even_power_invariant

One exact binary zero transition preserves the witnessed canonical power invariant.

layer 0 · 51 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE0008 · binary_execution_odd_power_invariant

One exact binary one transition preserves the witnessed canonical power invariant.

layer 0 · 64 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE0009 · binary_execution_step_power_invariant

Every actual zero-or-one modular transition preserves the matching binary-prefix power.

layer 1 · 60 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE000A · binary_execution_prefix_extend

Append one genuine beta-coded binary digit and canonical modular transition while preserving every previous execution state.

layer 0 · 109 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE000B · binary_execution_prefix_exists

Natural induction constructs a complete genuine beta-coded square-and-multiply trace for every supplied valid finite binary digit prefix.

layer 1 · 60 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE000C · binary_modular_execution_exists

Every guarded valid coded binary digit prefix has a genuine witnessed modular execution and decoded terminal result.

layer 2 · 30 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE000D · binary_modular_execution_empty

The terminal accumulator of any actual empty binary execution is exactly one.

layer 0 · 18 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE000E · binary_modular_execution_successor_decompose

Every nonempty actual binary execution decomposes into its exact valid predecessor and final modular transition.

layer 0 · 55 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE000F · binary_execution_horner_digit_split

A valid final Horner digit yields the exact exponent decomposition e=2h+d.

layer 0 · 16 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE0010 · binary_modular_execution_power_correct

Every genuine coded square-and-multiply execution is the canonical modular power of the exact base-two Horner exponent represented by its digit prefix.

layer 2 · 106 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE0011 · binary_modular_execution_horner_exists

Every valid beta-coded binary prefix has a witnessed Horner exponent, complete actual modular execution, and independently proved canonical power invariant.

layer 3 · 41 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE0012 · binary_modular_execution_result_functional

Any two complete actual coded square-and-multiply executions of the same guarded binary prefix have identical terminal residues.

layer 3 · 49 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable
BE0013 · binary_modular_execution_result_exists_unique

Every supplied valid beta-coded binary prefix has exactly one genuine guarded square-and-multiply execution result.

layer 4 · 33 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not Stable

Exactly 19 displayed theorems have independently verified Alpha checked-use authority; none is admitted to Stable. Body-only enrollment never grants checked theorem use.