BE0001 · binary_digit_prefix_emptyEvery 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 StableNineteen 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.
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.
BE0001 · binary_digit_prefix_emptyEvery 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 StableBE0002 · binary_digit_prefix_restrictEvery 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 StableBE0003 · binary_digit_prefix_terminal_bitEvery 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 StableBE0004 · binary_execution_initial_stateThere 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 StableBE0005 · binary_execution_step_digitEvery 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 StableBE0006 · binary_execution_power_zeroFor 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 StableBE0007 · binary_execution_even_power_invariantOne exact binary zero transition preserves the witnessed canonical power invariant.
layer 0 · 51 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not StableBE0008 · binary_execution_odd_power_invariantOne exact binary one transition preserves the witnessed canonical power invariant.
layer 0 · 64 lines · Alpha v34 independently verified · alpha_closed; checked-use authorized; not StableBE0009 · binary_execution_step_power_invariantEvery 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 StableBE000A · binary_execution_prefix_extendAppend 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 StableBE000B · binary_execution_prefix_existsNatural 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 StableBE000C · binary_modular_execution_existsEvery 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 StableBE000D · binary_modular_execution_emptyThe 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 StableBE000E · binary_modular_execution_successor_decomposeEvery 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 StableBE000F · binary_execution_horner_digit_splitA 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 StableBE0010 · binary_modular_execution_power_correctEvery 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 StableBE0011 · binary_modular_execution_horner_existsEvery 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 StableBE0012 · binary_modular_execution_result_functionalAny 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 StableBE0013 · binary_modular_execution_result_exists_uniqueEvery 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 StableExactly 19 displayed theorems have independently verified Alpha checked-use authority; none is admitted to Stable. Body-only enrollment never grants checked theorem use.