Base Field is prime
BN254.BaseField_is_prime
Plain-language statement
Proof that the BN254 base field characteristic is prime
Source project: ArkLib
Person-level attribution pending.
Source-pinned research
Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.
This index contains 573 research declarations. Search 10,000 more complete Mathlib declarations.
573 results
Clear filtersBN254.BaseField_is_prime
Plain-language statement
Proof that the BN254 base field characteristic is prime
Source project: ArkLib
Person-level attribution pending.
CA_split_rowwise_implies_CA
Plain-language statement
NOTE: This could be generalized to 2 * N instead of 2 ^ (ϑ + 1). Also, this can be proved for ↔ instead of →.
Source project: ArkLib
Person-level attribution pending.
cachingLoggingOracle.run'_simulateQ_eq
Plain-language statement
Output-only projection corollary of fst_map_run_simulateQ.
Source project: VCVio
Person-level attribution pending.
card_agreeing_cells_in_D_le
Plain-language statement
Lemma 3.3 (Part 2): Bound on agreeing cells inside D For any column j that is in the disagreement set D, there is at most one parameter r in R* such that the columns Uᵣ j and Vᵣ j agree. Therefore, the total number of agreeing cells (r, j) with j ∈ D is at most |D|.
Source project: ArkLib
Person-level attribution pending.
card_agreeing_cells_notin_D
Plain-language statement
Lemma 3.3 (Part 1): Bound on agreeing cells outside D The set of agreeing cells (r, j) where j ∉ D is exactly the Cartesian product of R* and Dᶜ (the columns not in D).
Source project: ArkLib
Person-level attribution pending.
card_filter_eval_subtype_eq_piFinset
Plain-language statement
The number of elements in ∀ i, ↥(S i) satisfying eval (↑·) f = 0 equals the number of elements in Fintype.piFinset (fun i => (S i).toFinset) satisfying eval · f = 0.
Source project: ArkLib
Person-level attribution pending.