kimchi::circuits::polynomials::turshi

Struct Claim

Source 
pub struct Claim<F>(/* private fields */);

Trait Implementations§

Source§

impl<F> Argument<F> for Claim<F>
where F: PrimeField,

Source§

fn constraint_checks<T: ExprOps<F, BerkeleyChallengeTerm>>( env: &ArgumentEnv<F, T>, _cache: &mut Cache, ) -> Vec<T>

Generates the constraints for the Cairo initial claim and first memory checks Accesses Curr and Next rows

Source§

const ARGUMENT_TYPE: ArgumentType

The type of constraints that this will produce. This is important to enforce that we don’t combine the constraints with powers of alpha that collide with other mutually inclusive arguments.
Source§

const CONSTRAINTS: u32 = 5u32

The number of constraints created by the argument.
Source§

fn constraints(cache: &mut Cache) -> Vec<E<F>> ⓘ

Returns the set of constraints required to prove this argument.
Source§

fn combined_constraints(alphas: &Alphas<F>, cache: &mut Cache) -> E<F>

Returns constraints safely combined via the passed combinator.

Auto Trait Implementations§

§

impl<F> Freeze for Claim<F>

§

impl<F> RefUnwindSafe for Claim<F>
where F: RefUnwindSafe,

§

impl<F> Send for Claim<F>
where F: Send,

§

impl<F> Sync for Claim<F>
where F: Sync,

§

impl<F> Unpin for Claim<F>
where F: Unpin,

§

impl<F> UnwindSafe for Claim<F>
where F: UnwindSafe,

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<F, T> DynArgument<F> for T
where F: PrimeField, T: Argument<F>,

Source§

fn constraints( &self, cache: &mut Cache, ) -> Vec<Operations<ExprInner<Operations<ConstantExprInner<F, BerkeleyChallengeTerm>>, Column>>>

Source§

fn combined_constraints( &self, alphas: &Alphas<F>, cache: &mut Cache, ) -> Operations<ExprInner<Operations<ConstantExprInner<F, BerkeleyChallengeTerm>>, Column>>

Source§

fn argument_type(&self) -> ArgumentType

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where 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

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 for T

Source§

type Output = T

Should always be Self
Source§

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

Source§

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 T
where U: TryFrom<T>,

Source§

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 T
where V: MultiLane<T>,

§

fn vzip(self) -> V