Base Field is prime
BN254.BaseField_is_prime
Plain-language statement
Proof that the BN254 base field characteristic is prime
Exact Lean statement
theorem BaseField_is_prime : Nat.Prime baseFieldSize
Formal artifact
Lean source
theorem BaseField_is_prime : Nat.Prime baseFieldSize := by unfold baseFieldSize refine PrattCertificate'.out (p := baseFieldSize) ⟨3, by reduce_mod_char, ?_⟩ refine .split [2, 3 ^ 2, 13, 29, 67, 229, 311, 983, 11003, 405928799, 11465965001, 13427688667394608761327070753331941386769] (fun r hr ↦ ?_) (by norm_num) simp only [Nat.reducePow, List.mem_cons, List.not_mem_nil, or_false] at hr rcases hr with hr | hr | hr | hr | hr | hr | hr | hr | hr | hr | hr | hr <;> rw [hr] · exact .prime 2 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 3 2 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 13 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 29 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 67 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 229 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 311 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 983 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 11003 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 405928799 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · refine .prime 11465965001 1 _ ?_ (by reduce_mod_char; decide) (by norm_num) refine PrattCertificate'.out ⟨3, by reduce_mod_char, ?_⟩ refine .split [2 ^ 3, 5 ^ 4, 7, 327599] (fun r hr ↦ ?_) (by norm_num) simp only [Nat.reducePow, List.mem_cons, List.not_mem_nil, or_false] at hr rcases hr with hr | hr | hr | hr <;> rw [hr] · exact .prime 2 3 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 5 4 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 7 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 327599 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · refine .prime 13427688667394608761327070753331941386769 1 _ ?_ (by reduce_mod_char; decide) (by norm_num) refine PrattCertificate'.out ⟨17, by reduce_mod_char, ?_⟩ refine .split [2 ^ 4, 3, 7, 11, 1853641, 4562087, 173171039, 2480874801745591] (fun r hr ↦ ?_) (by norm_num) simp only [Nat.reducePow, List.mem_cons, List.not_mem_nil, or_false] at hr rcases hr with hr | hr | hr | hr | hr | hr | hr | hr <;> rw [hr] · exact .prime 2 4 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 3 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 7 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 11 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 1853641 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 4562087 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 173171039 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · refine .prime 2480874801745591 1 _ ?_ (by reduce_mod_char; decide) (by norm_num) refine PrattCertificate'.out ⟨11, by reduce_mod_char, ?_⟩ refine .split [2, 3 ^ 2, 5, 19, 41, 35385462869] (fun r hr ↦ ?_) (by norm_num) simp only [Nat.reducePow, List.mem_cons, List.not_mem_nil, or_false] at hr rcases hr with hr | hr | hr | hr | hr | hr <;> rw [hr] · exact .prime 2 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 3 2 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 5 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 19 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 41 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num) · exact .prime 35385462869 1 _ (by pratt) (by reduce_mod_char; decide) (by norm_num)- Project
- ArkLib
- License
- Apache-2.0
- Commit
- fad5cbf80877
- Source
- ArkLib/Data/EllipticCurve/BN254.lean:47-142
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Affine gaps lifted to interleaved codes
affine_gaps_lifted_to_interleaved_codes
Project documentation
This lemma proves the final algebraic step in the DG25 Theorem 3.1 proof. It shows that if R > e + 1, then e * (R / (R - 1)) < e + 1. The intuition is that the fraction R / (R - 1) is always greater than 1, but as R gets larger, it gets closer to 1. The hypothesis R > e + 1 provides a strong enough bound to ensure the product e * (fraction) do...
Source project: ArkLib
Person-level attribution pending.
Gadget Decompose coeff
ArkLib.Lattices.Ajtai.gadgetDecompose_coeff
Plain-language statement
The k-th coefficient (k < deg φ) of a gadget-decomposition block is exactly the corresponding digit of the corresponding input coefficient.
Source project: ArkLib
Person-level attribution pending.
Gadget Decompose lawful
ArkLib.Lattices.Ajtai.gadgetDecompose_lawful
Plain-language statement
The base-b gadget decomposition is a lawful gadget decomposition.
Source project: ArkLib
Person-level attribution pending.