Fold Commit Oracle Verifier rbr Knowledge Soundness
Binius.BinaryBasefold.CoreInteraction.foldCommitOracleVerifier_rbrKnowledgeSoundness
Plain-language statement
RBR KS for Fold+Commitment block by append composition.
Exact Lean statement
theorem foldCommitOracleVerifier_rbrKnowledgeSoundness
(i : Fin ℓ) (hCR : isCommitmentRound ℓ ϑ i) :
(foldCommitOracleVerifier (mp := mp) 𝔽q β (h_ℓ_add_R_rate := h_ℓ_add_R_rate)
i hCR).rbrKnowledgeSoundness
init impl
(relIn := roundRelation (mp := mp) 𝔽q β (ϑ:=ϑ)
(h_ℓ_add_R_rate := h_ℓ_add_R_rate) i.castSucc)
(relOut := roundRelation (mp := mp) 𝔽q β (ϑ:=ϑ)
(h_ℓ_add_R_rate := h_ℓ_add_R_rate) i.succ)
(rbrKnowledgeError := fun _ => foldKnowledgeError (mp := mp) 𝔽q β (ϑ:=ϑ)
(h_ℓ_add_R_rate := h_ℓ_add_R_rate) i ⟨1, by rfl⟩
)Formal artifact
Lean source
theorem foldCommitOracleVerifier_rbrKnowledgeSoundness (i : Fin ℓ) (hCR : isCommitmentRound ℓ ϑ i) : (foldCommitOracleVerifier (mp := mp) 𝔽q β (h_ℓ_add_R_rate := h_ℓ_add_R_rate) i hCR).rbrKnowledgeSoundness init impl (relIn := roundRelation (mp := mp) 𝔽q β (ϑ:=ϑ) (h_ℓ_add_R_rate := h_ℓ_add_R_rate) i.castSucc) (relOut := roundRelation (mp := mp) 𝔽q β (ϑ:=ϑ) (h_ℓ_add_R_rate := h_ℓ_add_R_rate) i.succ) (rbrKnowledgeError := fun _ => foldKnowledgeError (mp := mp) 𝔽q β (ϑ:=ϑ) (h_ℓ_add_R_rate := h_ℓ_add_R_rate) i ⟨1, by rfl⟩ ) := by unfold foldCommitOracleVerifier pSpecFoldCommit have herr : (fun _ => foldKnowledgeError (mp := mp) 𝔽q β (ϑ := ϑ) (h_ℓ_add_R_rate := h_ℓ_add_R_rate) i ⟨1, by rfl⟩) = (Sum.elim (foldKnowledgeError (mp := mp) 𝔽q β (ϑ := ϑ) (h_ℓ_add_R_rate := h_ℓ_add_R_rate) i) (commitKnowledgeError 𝔽q β (h_ℓ_add_R_rate := h_ℓ_add_R_rate)) ∘ (ChallengeIdx.sumEquiv (pSpec₁ := pSpecFold (L := L) (d := mp.degCombinator + 1)) (pSpec₂ := pSpecCommit 𝔽q β (h_ℓ_add_R_rate := h_ℓ_add_R_rate) i)).symm) := by funext m simp only [Function.comp, ChallengeIdx.sumEquiv, Equiv.symm] dsimp split · simp [foldKnowledgeError] · next hlt => exfalso have hv := m.1.isLt have hp := m.2 simp only [ProtocolSpec.append, Fin.vappend_eq_append, Fin.append, Fin.addCases, Direction.not_P_to_V_eq_V_to_P] at hp split at hp <;> simp_all <;> omega rw [herr] exact OracleVerifier.append_rbrKnowledgeSoundness _ _ (foldOracleVerifier_rbrKnowledgeSoundness (mp := mp) 𝔽q β i) (commitOracleVerifier_rbrKnowledgeSoundness 𝔽q β i hCR)- Project
- ArkLib
- License
- Apache-2.0
- Commit
- fad5cbf80877
- Source
- ArkLib/ProofSystem/Binius/BinaryBasefold/CoreInteractionPhase.lean:207-242
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.