Skip to content

Update security estimator and adds multi grinding security estimator #405

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.

Sign up for GitHub

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

Draft
Al-Kindi-0 wants to merge 4 commits into
base: main
Choose a base branch
from
+3,364 −1,397
Draft

Update security estimator and adds multi grinding security estimator #405

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
6885d10
update estimator with new prox. gaps bound
Al-Kindi-0 Nov 24, 2025
ba67409
add RbR errors for the FRI layers commit part
Al-Kindi-0 Nov 25, 2025
1b69efc
Add multi-round grinding security estimator
Al-Kindi-0 Dec 8, 2025
bd89d46
feat: add some tooling for security analysis
Al-Kindi-0 Dec 8, 2025
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
610 changes: 610 additions & 0 deletions MULTI_ROUND_GRINDING_PLAN.md
View file
Open in desktop

Large diffs are not rendered by default.

3 changes: 3 additions & 0 deletions air/src/lib.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -32,6 +32,9 @@
#[macro_use]
extern crate alloc;

#[cfg(feature = "std")]
extern crate std;

pub mod proof;

mod errors;
Expand Down
16 changes: 10 additions & 6 deletions air/src/proof/mod.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,6 @@ use alloc::vec::Vec;
use crypto::{Hasher, MerkleTree};
use fri::FriProof;
use math::FieldElement;
use security::{ConjecturedSecurity, ProvenSecurity};
use utils::{ByteReader, Deserializable, DeserializationError, Serializable, SliceReader};

use crate::{options::BatchingMethod, ProofOptions, TraceInfo};
Expand All @@ -27,7 +26,12 @@ pub use queries::Queries;
mod ood_frame;
pub use ood_frame::{merge_ood_evaluations, OodFrame, QuotientOodFrame, TraceOodFrame};

mod security;
pub mod security;
pub use security::{
find_min_grinding_ldr, find_min_grinding_udr, find_min_queries_ldr, find_min_queries_udr,
plan_grinding_schedule_ldr, plan_grinding_schedule_udr, summarize_ldr, summarize_udr,
ConjecturedSecurity, GrindingSchedule, ProvenSecurity, RoundSecurity, SecuritySummary,
};

mod table;
pub use table::Table;
Expand Down Expand Up @@ -93,8 +97,8 @@ impl Proof {
///
/// This is the conjecture on the security of the Toy problem (Conjecture 1)
/// in https://eprint.iacr.org/2021/582.
pub fn conjectured_security<H: Hasher>(&self) -> ConjecturedSecurity {
ConjecturedSecurity::compute(
pub fn conjectured_security<H: Hasher>(&self) -> security::ConjecturedSecurity {
security::ConjecturedSecurity::compute(
self.context.options(),
self.context.num_modulus_bits(),
H::COLLISION_RESISTANCE,
Expand All @@ -104,7 +108,7 @@ 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 {
pub fn proven_security<H: Hasher>(&self) -> security::ProvenSecurity {
// note that we need the count of the total number of constraints in the protocol as
// the soundness error, in the case of algebraic batching, depends on the this number.
let num_constraints = self.context.num_constraints();
Expand All @@ -116,7 +120,7 @@ impl Proof {
let num_trace_polys = self.context.trace_info().width();
let num_constraint_composition_polys = self.options().blowup_factor();
let num_committed_polys = num_trace_polys + num_constraint_composition_polys;
ProvenSecurity::compute(
security::ProvenSecurity::compute(
self.context.options(),
self.context.num_modulus_bits(),
self.trace_info().length(),
Expand Down
Loading
Loading