pub struct LookupEnvironment<G: KimchiCurve> {
    pub tables_poly: Vec<Vec<DensePolynomial<G::ScalarField>>>,
    pub tables_comm: Vec<Vec<BlindedCommitment<G>>>,
    pub multiplicities: LookupMultiplicities,
}
Expand description

This is what the prover needs to remember while doing individual proofs, in order to prove the lookup protocol we do in the end

Fields§

§tables_poly: Vec<Vec<DensePolynomial<G::ScalarField>>>

fixed tables pre-existing the protocol

§tables_comm: Vec<Vec<BlindedCommitment<G>>>§multiplicities: LookupMultiplicities

multiplicities

Implementations§

source§

impl<G: KimchiCurve> LookupEnvironment<G>

Create a new prover environment, which interpolates the fixed tables and commit to them. Fills the multiplicities with zeroes

source

pub fn new(srs: &SRS<G>, domain: EvaluationDomains<G::ScalarField>) -> Self

source

pub fn add_multiplicities(&mut self, multiplicities: LookupMultiplicities)

Take a prover environment, a multiplicities, and returns a prover environment with the multiplicities being the addition of both

Auto Trait Implementations§

§

impl<G> RefUnwindSafe for LookupEnvironment<G>where G: RefUnwindSafe, <G as AffineRepr>::ScalarField: RefUnwindSafe,

§

impl<G> Send for LookupEnvironment<G>

§

impl<G> Sync for LookupEnvironment<G>

§

impl<G> Unpin for LookupEnvironment<G>where G: Unpin, <G as AffineRepr>::ScalarField: Unpin,

§

impl<G> UnwindSafe for LookupEnvironment<G>where G: UnwindSafe, <G as AffineRepr>::ScalarField: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T> Pointable for T

§

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Same<T> for T

§

type Output = T

Should always be Self
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<V, T> VZip<V> for Twhere V: MultiLane<T>,

§

fn vzip(self) -> V