You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The way we compute the proven security in get_proven_security takes into account only the FRI soundness error part $\epsilon_{FRI}$. It would be great to include the terms coming from the protocol pre-FRI.
I believe the update expression should be like:
$L^+ := \frac{m+0.5}{\sqrt{\rho^+}}$ where $m\geq 3$ is the Johnson proximity parameter which for simiplicity can be taken to be equal to $3$ and $\rho^+ := \frac{k^+}{n}$
$\mathbb{F}$ is the extension field.
$\epsilon_{FRI}$ is the soundness error bound for FRI run with proximity parameter $\theta^+ := 1 - \alpha^+ := 1 - (1 + \frac{1}{2m})\cdot \sqrt{\rho^+}$
$d$ is the number of constraint composition column polynomials.
The text was updated successfully, but these errors were encountered:
Not sure I'm reading this right; it looks like you're saying $d$ is the number of constraints? Or maybe constraint composition column polynomials is the number of segment polynomials?
Ulrich defines $d$ as the maximum degree of the constraints, but I think the expression in the error bound is actually the number of segment polynomials.
The way we compute the proven security in$\epsilon_{FRI}$ . It would be great to include the terms coming from the protocol pre-FRI.
get_proven_security
takes into account only the FRI soundness error partI believe the update expression should be like:
where:
The text was updated successfully, but these errors were encountered: