Generalised round consistency completeness
RoundConsistency.generalised_round_consistency_completeness
Plain-language statement
Completeness of the round consistency check. Given a polynomial f, challenge γ, and n-th roots of unity Ļ, when f is honestly evaluated at the scaled points {Ļ i * sā}, the round consistency check succeeds with the value (foldNth n f γ).eval (sā^n). This establishes that the Lagrange interpolant through the evaluation points matches the n-wa...
Source project: ArkLib
Person-level attribution pending.