Flagship declarations

Start with the mathematical results

Pinned project revision
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
Project-declaredLean 4.31.0

Gadget Decompose zmod l2Norm Sq le

ArkLib.Lattices.Ajtai.gadgetDecompose_zmod_l2NormSq_le

Plain-language statement

Each gadget-decomposition block is ℓ₂²-short: its centered squared-ℓ₂ norm is at most (deg φ)·(b-1)² (each of the deg φ coefficients contributes at most (b-1)²).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Decompose zmod vec L2Norm Sq le

ArkLib.Lattices.Ajtai.gadgetDecompose_zmod_vecL2NormSq_le

Plain-language statement

ℓ₂² shortness of G⁻¹. The full gadget decomposition has centered squared-ℓ₂ norm at most (rows·digits)·(deg φ)·(b-1)².

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Entry fin Prod Fin Equiv

ArkLib.Lattices.Ajtai.gadgetEntry_finProdFinEquiv

Plain-language statement

The gadget entry at the flattened index finProdFinEquiv (i', e) is constRq (base^e) on the diagonal block and 0 elsewhere.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record

Project index

More declarations

Search within this project

Showing 8 of 417 additional declarations. Use project search for the complete index.

Project-declaredLean 4.31.0

Gadget Mul apply

ArkLib.Lattices.Ajtai.gadgetMul_apply

Plain-language statement

The gadget product, evaluated at row i, is the base-weighted sum of the digits slots of block i.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Mul zmod coeff nat Abs le

ArkLib.Lattices.Ajtai.gadgetMul_zmod_coeff_natAbs_le

Plain-language statement

Core recomposition coefficient bound. Each centered coefficient of an entry of the gadget product G_{b,rows} ·ᵥ v is at most (∑_{u<digits} bᵘ) · γ whenever ‖v‖∞ ≤ γ. The wraparound of the ZMod q powers bᵘ is immaterial: the integer ∑ₑ bᵉ·valMinAbs(vₑ.coeff k) is an explicit representative of the output coefficient, and the centered represe...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Gadget Mul zmod vec L2Norm Sq le

ArkLib.Lattices.Ajtai.gadgetMul_zmod_vecL2NormSq_le

Plain-language statement

The J-recomposition ℓ₂² chain. From the range check ‖ẑ‖∞ ≤ γ (Eq. (20)'s ẑ ∈ S_b, symmetric model), the recomposed z = J·ẑ satisfies ‖z‖₂² ≤ zRecomposeL2SqBound γ b τ (deg φ) rows , no primitive ‖z‖₂² verifier check is needed.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Build Witness mem rel In

ArkLib.Lattices.Ajtai.InnerOuter.buildWitness_mem_relIn

Plain-language statement

The witness assembler is correct , the hmk input to the generic assembly coordinateWiseSpecialSound_of_mkWitness (SingleRound.lean), and the mathematical content of Hachi Lemma 8's three-case split: at every star-shaped family of relOut-accepting branches, buildWitness lands in relIn.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Eval Consistency of rel Out star

ArkLib.Lattices.Ajtai.InnerOuter.evalConsistency_of_relOut_star

Project documentation

Eval-consistency of the extracted opening (Hachi Lemma 8, case (C), part 2 , Eq. (15)): the shared-ŵ c3 row plus the coordinate-isolated, unit-divided c4 rows discharge the w/c3/c4 hypotheses of evalConsistency_of_star at the shared recomposed carrier w := G_{2^r} *ᵥ ŵ.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Generate Decomps message checks

ArkLib.Lattices.Ajtai.InnerOuter.generateDecomps_message_checks

Plain-language statement

Honest message decompositions pass the message gadget checks.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Inner eq of chain

ArkLib.Lattices.Ajtai.InnerOuter.inner_eq_of_chain

Project documentation

The c5-side unit-cancellation of the subtract-and-divide extraction (Hachi Lemma 8, case (C)): from the c5-subtract chain c̄ᵢ •ᵥ (G_{n_A} t̂ᵢ) = A *ᵥ Δz and IsUnit c̄ᵢ, the extracted message block sᵢ := Ring.inverse c̄ᵢ •ᵥ Δz satisfies the weak-opening inner gadget relation (VerifiedBlock.inner_eq).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Mem rel Poly Eval of rel In

ArkLib.Lattices.Ajtai.InnerOuter.mem_relPolyEval_of_relIn

Project documentation

Pull-back lemma (the hRel for the bridge's CWSS): a QuadEvalWitness accepted by QuadEval's relIn at the reinterpreted statement toQuadEvalStatement Φ s is accepted by relPolyEval at the polynomial-level statement s. The MSIS disjuncts are preserved verbatim (toQuadEvalStatement keeps pp); the opening disjunct converts the matrix-leve...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record