Struct snarkvm_algorithms::polycommit::kzg10::LagrangeBasis

source ·

pub struct LagrangeBasis<'a, E: PairingEngine> {
    pub lagrange_basis_at_beta_g: Cow<'a, [E::G1Affine]>,
    pub powers_of_beta_times_gamma_g: Cow<'a, [E::G1Affine]>,
    pub domain: EvaluationDomain<E::Fr>,
}

Expand description

LagrangeBasis is used to commit to and create evaluation proofs for a given polynomial.

Fields

lagrange_basis_at_beta_g: Cow<'a, [E::G1Affine]>

Group elements of the form β^i G, for different values of i.

powers_of_beta_times_gamma_g: Cow<'a, [E::G1Affine]>

Group elements of the form β^i γG, for different values of i.

domain: EvaluationDomain<E::Fr>

Domain representing the multiplicative subgroup the powers in self.lagrange_basis_at_beta_g are defined over.

Implementations

source

impl<E: PairingEngine> LagrangeBasis<'_, E>

source

pub fn size(&self) -> usize

The number of powers in self.

Trait Implementations

source

impl<'a, E: Clone + PairingEngine> Clone for LagrangeBasis<'a, E>where
 E::G1Affine: Clone,
 E::G1Affine: Clone,
 E::Fr: Clone,

source

fn clone(&self) -> LagrangeBasis<'a, E>

Returns a copy of the value. Read more

1.0.0 · source

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more

source

impl<'a, E: Debug + PairingEngine> Debug for LagrangeBasis<'a, E>where
 E::G1Affine: Debug,
 E::G1Affine: Debug,
 E::Fr: Debug,

source

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

source

impl<'a, E: Hash + PairingEngine> Hash for LagrangeBasis<'a, E>where
 E::G1Affine: Hash,
 E::G1Affine: Hash,
 E::Fr: Hash,

source

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher. Read more

1.3.0 · source

fn hash_slice<H>(data: &[Self], state: &mut H)where
H: Hasher,
Self: Sized,

Feeds a slice of this type into the given Hasher. Read more

Auto Trait Implementations

impl<'a, E> RefUnwindSafe for LagrangeBasis<'a, E>where
<E as PairingEngine>::Fr: RefUnwindSafe,
<E as PairingEngine>::G1Affine: RefUnwindSafe,

impl<'a, E> Send for LagrangeBasis<'a, E>

impl<'a, E> Sync for LagrangeBasis<'a, E>

impl<'a, E> Unpin for LagrangeBasis<'a, E>where
<E as PairingEngine>::Fr: Unpin,
<E as PairingEngine>::G1Affine: Unpin,

impl<'a, E> UnwindSafe for LagrangeBasis<'a, E>where
<E as PairingEngine>::Fr: UnwindSafe,
<E as PairingEngine>::G1Affine: UnwindSafe + RefUnwindSafe,

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,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · 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> ToOwned for Twhere
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

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

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

Struct snarkvm_algorithms::polycommit::kzg10::LagrangeBasis

Fields

Implementations

impl<E: PairingEngine> LagrangeBasis<'_, E>

pub fn size(&self) -> usize

Trait Implementations

impl<'a, E: Clone + PairingEngine> Clone for LagrangeBasis<'a, E>where E::G1Affine: Clone, E::G1Affine: Clone, E::Fr: Clone,

fn clone(&self) -> LagrangeBasis<'a, E>

fn clone_from(&mut self, source: &Self)

impl<'a, E: Debug + PairingEngine> Debug for LagrangeBasis<'a, E>where E::G1Affine: Debug, E::G1Affine: Debug, E::Fr: Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl<'a, E: Hash + PairingEngine> Hash for LagrangeBasis<'a, E>where E::G1Affine: Hash, E::G1Affine: Hash, E::Fr: Hash,

fn hash<__H: Hasher>(&self, state: &mut __H)

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Auto Trait Implementations

impl<'a, E> RefUnwindSafe for LagrangeBasis<'a, E>where <E as PairingEngine>::Fr: RefUnwindSafe, <E as PairingEngine>::G1Affine: RefUnwindSafe,

impl<'a, E> Send for LagrangeBasis<'a, E>

impl<'a, E> Sync for LagrangeBasis<'a, E>

impl<'a, E> Unpin for LagrangeBasis<'a, E>where <E as PairingEngine>::Fr: Unpin, <E as PairingEngine>::G1Affine: Unpin,

impl<'a, E> UnwindSafe for LagrangeBasis<'a, E>where <E as PairingEngine>::Fr: UnwindSafe, <E as PairingEngine>::G1Affine: UnwindSafe + RefUnwindSafe,

Blanket Implementations

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

impl<T> Pointable for T

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

type Init = T

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

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

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

unsafe fn drop(ptr: usize)

impl<T> Same<T> for T

type Output = T

impl<T> ToOwned for Twhere T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

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

type Error = Infallible

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

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

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

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

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

fn vzip(self) -> V

impl<'a, E: Clone + PairingEngine> Clone for LagrangeBasis<'a, E>where
E::G1Affine: Clone,
E::G1Affine: Clone,
E::Fr: Clone,

impl<'a, E: Debug + PairingEngine> Debug for LagrangeBasis<'a, E>where
E::G1Affine: Debug,
E::G1Affine: Debug,
E::Fr: Debug,

impl<'a, E: Hash + PairingEngine> Hash for LagrangeBasis<'a, E>where
E::G1Affine: Hash,
E::G1Affine: Hash,
E::Fr: Hash,

fn hash<H: Hasher>(&self, state: &mut H)

fn hash_slice<H>(data: &[Self], state: &mut H)where
H: Hasher,
Self: Sized,

impl<'a, E> RefUnwindSafe for LagrangeBasis<'a, E>where
<E as PairingEngine>::Fr: RefUnwindSafe,
<E as PairingEngine>::G1Affine: RefUnwindSafe,

impl<'a, E> Unpin for LagrangeBasis<'a, E>where
<E as PairingEngine>::Fr: Unpin,
<E as PairingEngine>::G1Affine: Unpin,

impl<'a, E> UnwindSafe for LagrangeBasis<'a, E>where
<E as PairingEngine>::Fr: UnwindSafe,
<E as PairingEngine>::G1Affine: UnwindSafe + RefUnwindSafe,

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

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

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

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

impl<T> ToOwned for Twhere
T: Clone,

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

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

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