Function binding query eq tau branch maps to arsdh
KZG.CommitmentScheme.function_binding_query_eq_tau_branch_maps_to_arsdh
Plain-language statement
The branch that finds a query equal to τ maps to ARSDH.
Exact Lean statement
lemma function_binding_query_eq_tau_branch_maps_to_arsdh {n : ℕ}
(hn : 1 ≤ n) (hp : p ≥ n + 2) (hg₁ : g₁ ≠ 1)
{τ α : ZMod p} {srs : Vector G₁ (n + 1) × Vector G₂ 2}
(hsrs : srs = Groups.PowerSrs.generate (g₁ := g₁) (g₂ := g₂) n τ)
(hgen : srs.1[0] ≠ 1)
(hpow : srs.1[0] ^ α.val = srs.1[1]'(Nat.lt_add_of_pos_left hn)) :
Groups.arsdhCondition n (τ, (queryEqTauArsdhOutput (p := p) n α srs).toTuple)Formal artifact
Lean source
lemma function_binding_query_eq_tau_branch_maps_to_arsdh {n : ℕ} (hn : 1 ≤ n) (hp : p ≥ n + 2) (hg₁ : g₁ ≠ 1) {τ α : ZMod p} {srs : Vector G₁ (n + 1) × Vector G₂ 2} (hsrs : srs = Groups.PowerSrs.generate (g₁ := g₁) (g₂ := g₂) n τ) (hgen : srs.1[0] ≠ 1) (hpow : srs.1[0] ^ α.val = srs.1[1]'(Nat.lt_add_of_pos_left hn)) : Groups.arsdhCondition n (τ, (queryEqTauArsdhOutput (p := p) n α srs).toTuple) := by simp only [queryEqTauArsdhOutput, FunctionBindingArsdhOutput.toTuple, Groups.arsdhCondition, ne_eq, one_div] have hord : orderOf g₁ = p := Groups.orderOf_eq_prime_of_ne_one g₁ hg₁ have hα_τ : α = τ := zmod_eq_of_srs_power_eq (g₁ := g₁) hn srs hsrs hord hpow refine ⟨?_, ?_, ?_, ?_⟩ · exact choose_s_middle_card hp α · rw [← hα_τ] exact choose_s_middle_eval_ne_zero α · exact hgen · rw [hα_τ]- Project
- ArkLib
- License
- Apache-2.0
- Commit
- fad5cbf80877
- Source
- ArkLib/Commitments/Functional/KZG/FunctionBinding/TauInQueries.lean:181-198
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.