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.
Exact expanded first-order arithmetic statement
forall p x y. x * x + y * y + 1 = p -> (exists fsl_a_prime fsl_b_prime fsl_c_prime fsl_d_prime. (p) = fsl_a_prime * fsl_a_prime + fsl_b_prime * fsl_b_prime + fsl_c_prime * fsl_c_prime + fsl_d_prime * fsl_d_prime)Constructive proof overview
Generated structural guide
A modular four-square seed whose multiplier is one directly represents the prime itself.
The unchanged tactic script uses 0 declared prerequisites and contains 10 exact native proof lines.
dependency-curried kernel-checked theorem body; Alpha enrollment and checked-use authority follow separately sealed release evidence; Stable membership remains unchanged
Proof neighborhood
Direct dependencies
Direct dependents
Formal native tactic body
Dependencies are introduced as named hypotheses before line 1. Local theorem links identify exact declared prerequisites. This dependency-curried candidate body does not grant checked theorem use or Stable membership.
Read the argument
Proof checkpoints
This is a reading aid, not a new proof or a proof-tree certificate. Checkpoint groups are consecutive commands, not inferred branch boundaries. Every step links to the preserved script.