Barycentric Low-degree Verification for FRI #156
Labels
🤖 code
Changes the implementation
✨ enhancement
Improvement or new feature
🟡 prio: medium
Not super urgent
⏩ speedup
Makes stuff go faster.
The last codeword sent in FRI has to be of low degree. What's the best way to prove this? The Miden team proposes this:
[q_i | 0 <= i < m]
and the polynomialP(X)
that corresponds to it (but don't send the coefficients known to be zero)τ
P(X)
inτ
using straightforward Horner evaluation[q_i | 0 <= i < m]
inτ
using the Barycentric Lagrange formula. This step requiresThe soundness error is bounded by
m / |F|
, where|F|
is the size of the field from whichτ
is drawn.The text was updated successfully, but these errors were encountered: