Inner relation of verified
ArkLib.Lattices.Ajtai.InnerOuter.WeakBinding.inner_relation_of_verified
Plain-language statement
Verified weak blocks with equal flattened inner decomps give a valid inner relation.
Exact Lean statement
theorem inner_relation_of_verified {base : ZMod q} {βSq γ κ : Nat}
{pp : PublicParams 𝓜(q, α)
innerRows messageRows messageDigits outerRows blocks innerDigits}
{u : Commitment 𝓜(q, α) outerRows}
{opening₁ opening₂ :
Opening 𝓜(q, α) innerRows messageRows messageDigits blocks innerDigits}
(hv₁ : VerifiedOpening 𝓜(q, α) base βSq γ κ pp u opening₁)
(hv₂ : VerifiedOpening 𝓜(q, α) base βSq γ κ pp u opening₂)
(hflat : PolyVec.flattenBlocks opening₁.innerDecomp =
PolyVec.flattenBlocks opening₂.innerDecomp)
{i : Fin blocks} (hmsgNe : opening₁.message i ≠ opening₂.message i) :
ModuleSIS.relation 𝓜(q, α) (innerShort 𝓜(q, α) κ βSq)
pp.innerMatrix (scaledMessage 𝓜(q, α) opening₁ opening₂ i -
scaledMessage 𝓜(q, α) opening₂ opening₁ i)
= trueFormal artifact
Lean source
theorem inner_relation_of_verified {base : ZMod q} {βSq γ κ : Nat} {pp : PublicParams 𝓜(q, α) innerRows messageRows messageDigits outerRows blocks innerDigits} {u : Commitment 𝓜(q, α) outerRows} {opening₁ opening₂ : Opening 𝓜(q, α) innerRows messageRows messageDigits blocks innerDigits} (hv₁ : VerifiedOpening 𝓜(q, α) base βSq γ κ pp u opening₁) (hv₂ : VerifiedOpening 𝓜(q, α) base βSq γ κ pp u opening₂) (hflat : PolyVec.flattenBlocks opening₁.innerDecomp = PolyVec.flattenBlocks opening₂.innerDecomp) {i : Fin blocks} (hmsgNe : opening₁.message i ≠ opening₂.message i) : ModuleSIS.relation 𝓜(q, α) (innerShort 𝓜(q, α) κ βSq) pp.innerMatrix (scaledMessage 𝓜(q, α) opening₁ opening₂ i - scaledMessage 𝓜(q, α) opening₂ opening₁ i) = true := by have hB₁ := hv₁.block i have hB₂ := hv₂.block i have hne : scaledMessage 𝓜(q, α) opening₁ opening₂ i - scaledMessage 𝓜(q, α) opening₂ opening₁ i ≠ 0 := sub_ne_zero.mpr (scaledMessage_ne_of_message_ne 𝓜(q, α) hB₁ hB₂ hmsgNe) have hshort : ‖scaledMessage 𝓜(q, α) opening₁ opening₂ i - scaledMessage 𝓜(q, α) opening₂ opening₁ i‖₂² ≤ subL2NormSqBound (scalarVecMulMulL2NormSqBound κ βSq) := sub_l2NormSq_le 𝓜(q, α) _ _ (scaledMessage_l2NormSq_le α hB₁ hB₂) (scaledMessage_l2NormSq_le α hB₂ hB₁) have hinnerEq := inner_commit_eq_of_flatten_eq 𝓜(q, α) hv₁ hv₂ hflat i have heq : pp.innerMatrix *ᵥ scaledMessage 𝓜(q, α) opening₁ opening₂ i = pp.innerMatrix *ᵥ scaledMessage 𝓜(q, α) opening₂ opening₁ i := by simpa [scaledMessage, Simple.commit] using matVecMul_scalarVecMul_mul_eq_of_eq pp.innerMatrix (opening₁.challenge i) (opening₂.challenge i) (by simpa [Simple.commit] using hinnerEq) have hker : pp.innerMatrix *ᵥ (scaledMessage 𝓜(q, α) opening₁ opening₂ i - scaledMessage 𝓜(q, α) opening₂ opening₁ i) = 0 := by rw [matVecMul_sub]; exact sub_eq_zero.mpr heq simp [ModuleSIS.relation, innerShort, hne, hshort, hker]- Project
- ArkLib
- License
- Apache-2.0
- Commit
- fad5cbf80877
- Source
- ArkLib/Commitments/Functional/Hachi/InnerOuter/Security.lean:252-287
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.