Recommended
Defined mathematical notation
Browse 20 linked conservative definitions and 19 independently checked theorems without losing their exact first-order expansions.
Browse definitions and theorems →Complete beta-coded traces · Horner power invariants · unique modular output · Constructive arithmetic
digits∈{0,1} · rᵢ₊₁≡rᵢ²a^digitᵢ (mod m) · r≡a^Horner(digits)
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.
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.
Recommended
Browse 20 linked conservative definitions and 19 independently checked theorems without losing their exact first-order expansions.
Browse definitions and theorems →Exact certificate
Inspect all 794 native tactic lines and 60 actual proof prerequisites with every definition fully expanded.
Open the exact edition →Focused route
Start at theorem BE0013 and follow only the lemmas and conservative definitions supporting binary_modular_execution_result_exists_unique.
BE000B binary_execution_prefix_exists · BE000C binary_modular_execution_exists · BE0010 binary_modular_execution_power_correct · BE0011 binary_modular_execution_horner_exists · BE0013 binary_modular_execution_result_exists_unique.95e5f8a3baef113721d748f9d7071864b4bf9511737a27a1272d2695428fb938.