All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Conflict query ne tau

KZG.CommitmentScheme.conflict_query_ne_tau

Plain-language statement

A genuine evaluation conflict cannot occur at the hidden trapdoor point.

Exact Lean statement

lemma conflict_query_ne_tau (hpG1 : Nat.card G₁ = p) (hn : 1 ≤ n)
    (α₁ α₂ β₁ β₂ τ : ZMod p) (c pf₁ pf₂ : G₁) (hα : α₁ = α₂)
    (hβ : β₁ ≠ β₂) (srs : Vector G₁ (n + 1) × Vector G₂ 2)
    (hsrs : srs = Groups.PowerSrs.generate (g₁ := g₁) (g₂ := g₂) n τ)
    (hgen : srs.1[0] ≠ 1) (hpair : pairing g₁ g₂ ≠ 0)
    (hverify₁ : KZG.verifyOpening (g₁ := g₁) (g₂ := g₂) (pairing := pairing)
      srs.2 c pf₁ α₁ β₁)
    (hverify₂ : KZG.verifyOpening (g₁ := g₁) (g₂ := g₂) (pairing := pairing)
      srs.2 c pf₂ α₂ β₂) :
    α₁ ≠ τ

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma conflict_query_ne_tau (hpG1 : Nat.card G₁ = p) (hn : 1  n)    (α₁ α₂ β₁ β₂ τ : ZMod p) (c pf₁ pf₂ : G₁) (hα : α₁ = α₂)    (hβ : β₁  β₂) (srs : Vector G₁ (n + 1) × Vector G₂ 2)    (hsrs : srs = Groups.PowerSrs.generate (g₁ := g₁) (g₂ := g₂) n τ)    (hgen : srs.1[0]  1) (hpair : pairing g₁ g₂  0)    (hverify₁ : KZG.verifyOpening (g₁ := g₁) (g₂ := g₂) (pairing := pairing)      srs.2 c pf₁ α₁ β₁)    (hverify₂ : KZG.verifyOpening (g₁ := g₁) (g₂ := g₂) (pairing := pairing)      srs.2 c pf₂ α₂ β₂) :    α₁  τ := by  intro hατ  have hg₁ : g₁  1 :=    Groups.PowerSrs.generator_ne_one_of_generate (g₁ := g₁) (g₂ := g₂) hsrs hgen  have hord : orderOf g₁ = p := Groups.orderOf_eq_prime_of_ne_one g₁ hg₁  obtain cm, hc := Groups.exists_zmod_power_of_generator hpG1 hg₁ hord c  obtain prf₁, hprf₁ := Groups.exists_zmod_power_of_generator hpG1 hg₁ hord pf₁  obtain prf₂, hprf₂ := Groups.exists_zmod_power_of_generator hpG1 hg₁ hord pf₂  have hfield_verify₁ : cm = prf₁ *- α₁) + β₁ := by    grind [verify_opening_equation pairing α₁ β₁ τ cm prf₁ c pf₁ srs hsrs hpair      hc hprf₁ hverify₁]  have hfield_verify₂ : cm = prf₂ *- α₁) + β₂ := by    rw [ hα] at hverify₂    grind [verify_opening_equation pairing α₁ β₂ τ cm prf₂ c pf₂ srs hsrs hpair      hc hprf₂ hverify₂]  have hfield_conflict : prf₁ *- α₁) + β₁ = prf₂ *- α₁) + β₂ := by    simp_all  apply  have hzero : τ - α₁ = 0 := by simp [hατ]  simpa [hzero] using hfield_conflict
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Commitments/Functional/KZG/FunctionBinding/EvaluationBindingConflict.lean:353-381

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

Project-declaredLean 4.31.0

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...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

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.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Decompose lawful

ArkLib.Lattices.Ajtai.gadgetDecompose_lawful

Plain-language statement

The base-b gadget decomposition is a lawful gadget decomposition.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record