Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update security estimator to take into account method of batching #361

Open
wants to merge 2 commits into
base: main
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 8 additions & 1 deletion air/src/proof/mod.rs
Original file line number Diff line number Diff line change
Expand Up @@ -103,7 +103,6 @@ impl Proof {
ConjecturedSecurity::compute(
self.context.options(),
self.context.num_modulus_bits(),
self.trace_info().length(),
H::COLLISION_RESISTANCE,
)
}
Expand All @@ -112,11 +111,19 @@ impl Proof {
/// Usually, the number of queries needed for provable security is 2x - 3x higher than
/// the number of queries needed for conjectured security at the same security level.
pub fn proven_security<H: Hasher>(&self) -> ProvenSecurity {
// we need to count the number of code words appearing in the protocol as the soundness
// error, in the case of algebraic batching, depends on the this number.
// we use the blowup factor as an upper bound on the number of constraint composition
// polynomials.
let num_trace_polys = self.context.trace_info().width();
let num_constraint_composition_polys = self.options().blowup_factor();
let total_number_of_polys = num_trace_polys + num_constraint_composition_polys;
ProvenSecurity::compute(
self.context.options(),
self.context.num_modulus_bits(),
self.trace_info().length(),
H::COLLISION_RESISTANCE,
total_number_of_polys,
)
}

Expand Down
Loading