dusk-plonk 0.13.1

// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this
// file, You can obtain one at http://mozilla.org/MPL/2.0/.
//
// Copyright (c) DUSK NETWORK. All rights reserved.

//! Methods to preprocess the constraint system for use in a proof

use crate::fft::Polynomial;

/// Struct that contains all selector and permutation [`Polynomials`]s
pub(crate) struct Polynomials {
    // selector polynomials defining arithmetic circuits
    pub(crate) q_m: Polynomial,
    pub(crate) q_l: Polynomial,
    pub(crate) q_r: Polynomial,
    pub(crate) q_o: Polynomial,
    pub(crate) q_c: Polynomial,

    // additional selector for 3-input gates added for efficiency of
    // implementation
    pub(crate) q_4: Polynomial,

    // additional selectors for different kinds of circuits added for
    // efficiency of implementation
    pub(crate) q_arith: Polynomial, // arithmetic circuits
    pub(crate) q_range: Polynomial, // range proofs
    pub(crate) q_logic: Polynomial, // boolean operations
    pub(crate) q_fixed_group_add: Polynomial, // ecc circuits
    pub(crate) q_variable_group_add: Polynomial, // ecc circuits

    // copy permutation polynomials
    pub(crate) s_sigma_1: Polynomial,
    pub(crate) s_sigma_2: Polynomial,
    pub(crate) s_sigma_3: Polynomial,
    pub(crate) s_sigma_4: Polynomial, // for q_4
}