Research proof index

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

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

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.

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.

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} *ᵥ ŵ.

Honest message decompositions pass the message gadget checks.