Recommended
Defined mathematical notation
Browse 21 linked conservative definitions and 49 independently checked theorems without losing their exact first-order expansions.
Browse definitions and theorems →Canonical coefficients · witnessed modular histories · re-encoding · Constructive arithmetic
h₀=0; hᵢ₊₁ = hᵢ·x + aᵢ in Fₚ; coefficients are highest-degree-first
Normalize finite coefficient data, construct coefficientwise arithmetic, and execute an actual modular Horner trace using the already proved canonical field operations.
Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Recommended
Browse 21 linked conservative definitions and 49 independently checked theorems without losing their exact first-order expansions.
Browse definitions and theorems →Exact certificate
Inspect all 2829 native tactic lines and 131 actual proof prerequisites with every definition fully expanded.
Open the exact edition →Focused route
Start at theorem PP0031 and follow only the lemmas and conservative definitions supporting prime_field_polynomial_reduce_and_evaluate_exists.
PP002A prime_field_polynomial_horner_exists_unique · PP002F prime_field_polynomial_normalized_horner_iff · PP0031 prime_field_polynomial_reduce_and_evaluate_exists.6e3a08c73b8a45de127e6d50a771f95b52fd54894b1c2e43468751421488a01a.