All proofs
Project-declaredLean 4.31.0 · mathlib@fabf563a7c95

Correctness

KZG.CommitmentScheme.correctness

Plain-language statement

The KZG scheme satisfies perfect correctness as defined in CommitmentScheme.

Exact Lean statement

theorem correctness (hpG1 : Nat.card G₁ = p) {g₁ : G₁} {g₂ : G₂}
    [SampleableType G₁] :
    Commitment.perfectCorrectness (pure ∅) (randomOracle)
    (kzg (n := n) (g₁ := g₁) (g₂ := g₂) (pairing := pairing))

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem correctness (hpG1 : Nat.card G₁ = p) {g₁ : G₁} {g₂ : G₂}    [SampleableType G₁] :    Commitment.perfectCorrectness (pure ∅) (randomOracle)    (kzg (n := n) (g₁ := g₁) (g₂ := g₂) (pairing := pairing)) := by  intro data query  simp only [ENNReal.coe_zero, tsub_zero]  rw [ge_iff_le, one_le_probEvent_iff]  refine OptionT.probEvent_eq_one_of_simulateQ_support _ _ ∅ _ ?_  intro x hx  simp only [kzg] at hx  rw [mem_support_bind_iff] at hx  obtain ⟨⟨ck, vk, hkeygen, hx := hx  rw [mem_support_bind_iff] at hx  obtain ⟨⟨cm, decomm, hcommit, hx := hx  replace hkeygen := OracleComp.mem_support_of_mem_support_liftComp    (superSpec := _) (oa := _) (x := (ck, vk)) hkeygen  replace hcommit := OracleComp.mem_support_of_mem_support_liftComp    (superSpec := _) (oa := _) (x := (cm, decomm)) hcommit  rw [mem_support_bind_iff] at hkeygen  obtain τ, _hτ, hkeygen := hkeygen  rw [mem_support_pure_iff] at hkeygen  simp only [Prod.mk.injEq] at hkeygen  obtain rfl, rfl := hkeygen  rw [mem_support_pure_iff] at hcommit  obtain rfl, rfl := Prod.mk.inj hcommit  haveI : ProverOnly ({ dir := !v[Direction.P_to_V], «Type» := !v[G₁] } : ProtocolSpec 1) := {    prover_first' := by simp  }  rw [Reduction.run_of_prover_first] at hx  simp only [OptionT.run_bind, OptionT.run_pure] at hx  have hverify : verifyOpening (g₁ := g₁) (g₂ := g₂) pairing      (Groups.PowerSrs.generate (g₁ := g₁) (g₂ := g₂) n τ).2      (commit (Groups.PowerSrs.generate (g₁ := g₁) (g₂ := g₂) n τ).1 data)      (generateOpening (Groups.PowerSrs.generate (g₁ := g₁) (g₂ := g₂) n τ).1 data query)      query (OracleInterface.answer data query) := by    change verifyOpening pairing _ _ _ query ((CPolynomial.ofFn data).eval query) = true    simpa only [CPolynomial.ofFn] using      KZG.correctness (pairing := pairing) (g₁ := g₁) (g₂ := g₂) hpG1 n τ data query  simp only [Option.elimM] at hx  rw [mem_support_bind_iff] at hx  obtain openingOpt, hopeningOpt, hx := hx  simp at hopeningOpt  subst openingOpt  dsimp only [Option.elim] at hx  rw [mem_support_bind_iff] at hx  obtain outputOpt, houtputOpt, hx := hx  simp at houtputOpt  subst outputOpt  dsimp only [Option.elim] at hx  rw [mem_support_bind_iff] at hx  obtain verifierOpt, hverifierOpt, hx := hx  simp [hverify] at hverifierOpt  subst verifierOpt  simp only [Option.getM_some] at hx  rw [mem_support_bind_iff] at hx  obtain verdict, hverdict, hx := hx  simp at hverdict  subst verdict  simp at hx  subst x  simp [acceptRejectRel]
Project
ArkLib
License
Apache-2.0
Commit
fad5cbf80877
Source
ArkLib/Commitments/Functional/KZG/Correctness.lean:161-221

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