1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284
// Copyright (c) Facebook, Inc. and its affiliates.
//
// This source code is licensed under the MIT license found in the
// LICENSE file in the root directory of this source tree.
use crate::{air::TransitionConstraintDegree, ProofOptions, TraceInfo};
use math::{log2, StarkField};
use utils::collections::Vec;
// AIR CONTEXT
// ================================================================================================
/// STARK parameters and trace properties for a specific execution of a computation.
#[derive(Clone, PartialEq, Eq)]
pub struct AirContext<B: StarkField> {
pub(super) options: ProofOptions,
pub(super) trace_info: TraceInfo,
pub(super) main_transition_constraint_degrees: Vec<TransitionConstraintDegree>,
pub(super) aux_transition_constraint_degrees: Vec<TransitionConstraintDegree>,
pub(super) num_main_assertions: usize,
pub(super) num_aux_assertions: usize,
pub(super) ce_blowup_factor: usize,
pub(super) trace_domain_generator: B,
pub(super) lde_domain_generator: B,
pub(super) num_transition_exemptions: usize,
}
impl<B: StarkField> AirContext<B> {
// CONSTRUCTORS
// --------------------------------------------------------------------------------------------
/// Returns a new instance of [AirContext] instantiated for computations which require a single
/// execution trace segment.
///
/// The list of transition constraint degrees defines the total number of transition
/// constraints and their expected degrees. Constraint evaluations computed by
/// [Air::evaluate_transition()](crate::Air::evaluate_transition) function are expected to be
/// in the order defined by this list.
///
/// # Panics
/// Panics if
/// * `transition_constraint_degrees` is an empty vector.
/// * `num_assertions` is zero.
/// * Blowup factor specified by the provided `options` is too small to accommodate degrees
/// of the specified transition constraints.
/// * `trace_info` describes a multi-segment execution trace.
pub fn new(
trace_info: TraceInfo,
transition_constraint_degrees: Vec<TransitionConstraintDegree>,
num_assertions: usize,
options: ProofOptions,
) -> Self {
assert!(
!trace_info.is_multi_segment(),
"provided trace info describes a multi-segment execution trace"
);
Self::new_multi_segment(
trace_info,
transition_constraint_degrees,
Vec::new(),
num_assertions,
0,
options,
)
}
/// Returns a new instance of [AirContext] instantiated for computations which require multiple
/// execution trace segments.
///
/// The lists of transition constraint degrees defines the total number of transition
/// constraints and their expected degrees. Constraint evaluations computed by
/// [Air::evaluate_transition()](crate::Air::evaluate_transition) function are expected to be
/// in the order defined by `main_transition_constraint_degrees` list. Constraint evaluations
/// computed by [Air::evaluate_aux_transition()](crate::Air::evaluate_aux_transition) function
/// are expected to be in the order defined by `aux_transition_constraint_degrees` list.
///
/// # Panics
/// Panics if
/// * `main_transition_constraint_degrees` is an empty vector.
/// * `num_main_assertions` is zero.
/// * `trace_info.is_multi_segment() == true` but:
/// - `aux_transition_constraint_degrees` is an empty vector.
/// - `num_aux_assertions` is zero.
/// * `trace_info.is_multi_segment() == false` but:
/// - `aux_transition_constraint_degrees` is a non-empty vector.
/// - `num_aux_assertions` is greater than zero.
/// * Blowup factor specified by the provided `options` is too small to accommodate degrees
/// of the specified transition constraints.
pub fn new_multi_segment(
trace_info: TraceInfo,
main_transition_constraint_degrees: Vec<TransitionConstraintDegree>,
aux_transition_constraint_degrees: Vec<TransitionConstraintDegree>,
num_main_assertions: usize,
num_aux_assertions: usize,
options: ProofOptions,
) -> Self {
assert!(
!main_transition_constraint_degrees.is_empty(),
"at least one transition constraint degree must be specified"
);
assert!(
num_main_assertions > 0,
"at least one assertion must be specified"
);
if trace_info.is_multi_segment() {
assert!(
!aux_transition_constraint_degrees.is_empty(),
"at least one transition constraint degree must be specified for auxiliary trace segments"
);
assert!(
num_aux_assertions > 0,
"at least one assertion must be specified against auxiliary trace segments"
);
} else {
assert!(
aux_transition_constraint_degrees.is_empty(),
"auxiliary transition constraint degrees specified for a single-segment trace"
);
assert!(
num_aux_assertions == 0,
"auxiliary assertions specified for a single-segment trace"
);
}
// determine minimum blowup factor needed to evaluate transition constraints by taking
// the blowup factor of the highest degree constraint
let mut ce_blowup_factor = 0;
for degree in main_transition_constraint_degrees.iter() {
if degree.min_blowup_factor() > ce_blowup_factor {
ce_blowup_factor = degree.min_blowup_factor();
}
}
for degree in aux_transition_constraint_degrees.iter() {
if degree.min_blowup_factor() > ce_blowup_factor {
ce_blowup_factor = degree.min_blowup_factor();
}
}
assert!(
options.blowup_factor() >= ce_blowup_factor,
"blowup factor too small; expected at least {}, but was {}",
ce_blowup_factor,
options.blowup_factor()
);
let trace_length = trace_info.length();
let lde_domain_size = trace_length * options.blowup_factor();
AirContext {
options,
trace_info,
main_transition_constraint_degrees,
aux_transition_constraint_degrees,
num_main_assertions,
num_aux_assertions,
ce_blowup_factor,
trace_domain_generator: B::get_root_of_unity(log2(trace_length)),
lde_domain_generator: B::get_root_of_unity(log2(lde_domain_size)),
num_transition_exemptions: 1,
}
}
// PUBLIC ACCESSORS
// --------------------------------------------------------------------------------------------
/// Returns length of the execution trace for an instance of a computation.
///
// This is guaranteed to be a power of two greater than or equal to 8.
pub fn trace_len(&self) -> usize {
self.trace_info.length()
}
/// Returns degree of trace polynomials for an instance of a computation.
///
/// The degree is always `trace_length` - 1.
pub fn trace_poly_degree(&self) -> usize {
self.trace_info.length() - 1
}
/// Returns size of the constraint evaluation domain.
///
/// This is guaranteed to be a power of two, and is equal to `trace_length * ce_blowup_factor`.
pub fn ce_domain_size(&self) -> usize {
self.trace_info.length() * self.ce_blowup_factor
}
/// Returns the degree to which all constraint polynomials are normalized before they are
/// composed together.
///
/// This degree is always `ce_domain_size` - 1.
pub fn composition_degree(&self) -> usize {
self.ce_domain_size() - 1
}
/// Returns the size of the low-degree extension domain.
///
/// This is guaranteed to be a power of two, and is equal to `trace_length * lde_blowup_factor`.
pub fn lde_domain_size(&self) -> usize {
self.trace_info.length() * self.options.blowup_factor()
}
/// Returns the number of transition constraints for a computation.
///
/// The number of transition constraints is defined by the total number of transition
/// constraint degree descriptors (for both the main and the auxiliary trace constraints).
/// This number is used to determine how many transition constraint coefficients need to be
/// generated for merging transition constraints into a composition polynomial.
pub fn num_transition_constraints(&self) -> usize {
self.main_transition_constraint_degrees.len() + self.aux_transition_constraint_degrees.len()
}
/// Returns the number of transition constraints placed against the main trace segment.
pub fn num_main_transition_constraints(&self) -> usize {
self.main_transition_constraint_degrees.len()
}
/// Returns the number of transition constraints placed against all auxiliary trace segments.
pub fn num_aux_transition_constraints(&self) -> usize {
self.aux_transition_constraint_degrees.len()
}
/// Returns the total number of assertions defined for a computation.
///
/// The number of assertions consists of the assertions placed against the main segment of an
/// execution trace as well as assertions placed against all auxiliary trace segments.
pub fn num_assertions(&self) -> usize {
self.num_main_assertions + self.num_aux_assertions
}
/// Returns the number of rows at the end of an execution trace to which transition constraints
/// do not apply.
///
/// This is guaranteed to be at least 1 (which is the default value), but could be greater.
/// The maximum number of exemptions is determined by a combination of transition constraint
/// degrees and blowup factor specified for the computation.
pub fn num_transition_exemptions(&self) -> usize {
self.num_transition_exemptions
}
// DATA MUTATORS
// --------------------------------------------------------------------------------------------
/// Sets the number of transition exemptions for this context.
///
/// # Panics
/// Panics if:
/// * The number of exemptions is zero.
/// * The number of exemptions exceeds half of the trace length.
/// * Given the combination of transition constraints degrees and the blowup factor in this
/// context, the number of exemptions is too larger for a valid computation of the constraint
/// composition polynomial.
pub fn set_num_transition_exemptions(mut self, n: usize) -> Self {
assert!(
n > 0,
"number of transition exemptions must be greater than zero"
);
// exemptions which are for more than half the trace are probably a mistake
assert!(
n <= self.trace_len() / 2,
"number of transition exemptions cannot exceed {}, but was {}",
self.trace_len() / 2,
n
);
// make sure the composition polynomial can be computed correctly with the specified
// number of exemptions
for degree in self
.main_transition_constraint_degrees
.iter()
.chain(self.aux_transition_constraint_degrees.iter())
{
let eval_degree = degree.get_evaluation_degree(self.trace_len());
let max_exemptions = self.composition_degree() + self.trace_len() - eval_degree;
assert!(
n <= max_exemptions,
"number of transition exemptions cannot exceed: {}, but was {}",
max_exemptions,
n
)
}
self.num_transition_exemptions = n;
self
}
}