winter-prover 0.13.1

Winterfell STARK prover
Documentation 
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

// 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 air::Air;
use math::FieldElement;

use super::{super::TraceLde, CompositionPolyTrace, ConstraintEvaluationTable, StarkDomain};

mod default;
pub use default::DefaultConstraintEvaluator;

mod boundary;
use boundary::BoundaryConstraints;

mod periodic_table;
use periodic_table::PeriodicValueTable;

// CONSTRAINT EVALUATOR TRAIT
// ================================================================================================

/// Contains logic for evaluating AIR constraints over an extended execution trace.
///
/// The logic for evaluating AIR constraints over a single evaluation frame is defined by the [Air]
/// associated type, and the purpose of this trait is to execute this logic over all evaluation
/// frames in an extended execution trace.
pub trait ConstraintEvaluator<E: FieldElement> {
    /// AIR constraints for the computation described by this evaluator.
    type Air: Air<BaseField = E::BaseField>;

    /// Evaluates constraints against the provided extended execution trace, combines them into
    /// evaluations of a single polynomial, and returns these evaluations.
    ///
    /// Constraints are evaluated over a constraint evaluation domain. This is an optimization
    /// because constraint evaluation domain can be many times smaller than the full LDE domain.
    fn evaluate<T: TraceLde<E>>(
        self,
        trace: &T,
        domain: &StarkDomain<E::BaseField>,
    ) -> CompositionPolyTrace<E>;
}