Struct BinaryU64Poly 

pub struct BinaryU64Poly<const DEGREE_PLUS_ONE: usize>(/* private fields */);

Implementations

impl<const DEGREE_PLUS_ONE: usize> BinaryU64Poly<DEGREE_PLUS_ONE>

pub const fn inner(&self) -> &u64

impl<const DEGREE_PLUS_ONE: usize> BinaryU64Poly<DEGREE_PLUS_ONE>

pub fn new(coeffs: impl AsRef<[Boolean]>) -> Self

Create a new polynomial with the given coefficients. If the input has fewer than N+1 coefficients, the remaining slots will be filled with zeros. If the input has more than N+1 coefficients, it will panic.

pub fn new_padded(coeffs: impl AsRef<[Boolean]>) -> Self

Create a new polynomial with the given coefficients. If the input has fewer than N+1 coefficients, the remaining slots will be filled with zeros. If the input has more than N+1 coefficients, it will panic.

impl<const DEGREE_PLUS_ONE: usize> BinaryU64Poly<DEGREE_PLUS_ONE>

pub fn iter(&self) -> BinaryU64PolyIter<'_, DEGREE_PLUS_ONE>

Trait Implementations

impl<'a, const DEGREE_PLUS_ONE: usize> Add<&'a BinaryU64Poly<DEGREE_PLUS_ONE>> for BinaryU64Poly<DEGREE_PLUS_ONE>

type Output = BinaryU64Poly<DEGREE_PLUS_ONE>

The resulting type after applying the + operator.

fn add(self, rhs: &'a Self) -> Self::Output

Performs the + operation.

impl<const DEGREE_PLUS_ONE: usize> Add for BinaryU64Poly<DEGREE_PLUS_ONE>

type Output = BinaryU64Poly<DEGREE_PLUS_ONE>

The resulting type after applying the + operator.

fn add(self, rhs: Self) -> Self::Output

Performs the + operation.

impl<'a, const DEGREE_PLUS_ONE: usize> AddAssign<&'a BinaryU64Poly<DEGREE_PLUS_ONE>> for BinaryU64Poly<DEGREE_PLUS_ONE>

fn add_assign(&mut self, rhs: &'a Self)

Performs the += operation.

impl<const DEGREE_PLUS_ONE: usize> AddAssign for BinaryU64Poly<DEGREE_PLUS_ONE>

fn add_assign(&mut self, rhs: Self)

Performs the += operation.

impl<const DEGREE_PLUS_ONE: usize> AsRef<u64> for BinaryU64Poly<DEGREE_PLUS_ONE>

fn as_ref(&self) -> &u64

Converts this type into a shared reference of the (usually inferred) input type.

impl<const DEGREE_PLUS_ONE: usize> CheckedAdd for BinaryU64Poly<DEGREE_PLUS_ONE>

fn checked_add(&self, other: &Self) -> Option<Self>

Adds two numbers, checking for overflow. If overflow happens, None is returned.

impl<const DEGREE_PLUS_ONE: usize> CheckedMul for BinaryU64Poly<DEGREE_PLUS_ONE>

fn checked_mul(&self, _other: &Self) -> Option<Self>

Multiplies two numbers, checking for underflow or overflow. If underflow or overflow happens, None is returned.

impl<const DEGREE_PLUS_ONE: usize> CheckedSub for BinaryU64Poly<DEGREE_PLUS_ONE>

fn checked_sub(&self, other: &Self) -> Option<Self>

Subtracts two numbers, checking for underflow. If underflow happens, None is returned.

impl<const DEGREE_PLUS_ONE: usize> Clone for BinaryU64Poly<DEGREE_PLUS_ONE>

fn clone(&self) -> BinaryU64Poly<DEGREE_PLUS_ONE>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const DEGREE_PLUS_ONE: usize> ConstCoeffBitWidth for BinaryU64Poly<DEGREE_PLUS_ONE>

const COEFF_BIT_WIDTH: usize = DensePolynomial<Boolean, DEGREE_PLUS_ONE>::COEFF_BIT_WIDTH

impl<const DEGREE_PLUS_ONE: usize> ConstTranscribable for BinaryU64Poly<DEGREE_PLUS_ONE>

const NUM_BYTES: usize = <u64 as ::zinc_transcript::traits::ConstTranscribable>::NUM_BYTES

Number of bytes required to represent this type.

const NUM_BITS: usize = <u64 as ::zinc_transcript::traits::ConstTranscribable>::NUM_BITS

Number of bits actually used to store data.

impl<const DEGREE_PLUS_ONE: usize> Debug for BinaryU64Poly<DEGREE_PLUS_ONE>

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

Formats the value using the given formatter.

impl<const DEGREE_PLUS_ONE: usize> Default for BinaryU64Poly<DEGREE_PLUS_ONE>

fn default() -> BinaryU64Poly<DEGREE_PLUS_ONE>

Returns the “default value” for a type.

impl<const DEGREE_PLUS_ONE: usize> Display for BinaryU64Poly<DEGREE_PLUS_ONE>

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

Formats the value using the given formatter.

impl<const DEGREE_PLUS_ONE: usize> Distribution<BinaryU64Poly<DEGREE_PLUS_ONE>> for StandardUniform

fn sample<Gen: Rng + ?Sized>( &self, rng: &mut Gen, ) -> BinaryU64Poly<DEGREE_PLUS_ONE>

Generate a random value of T, using rng as the source of randomness.

fn sample_iter<R>(self, rng: R) -> Iter<Self, R, T>

where R: Rng, Self: Sized,

Create an iterator that generates random values of T, using rng as the source of randomness.

fn map<F, S>(self, func: F) -> Map<Self, F, T, S>

where F: Fn(T) -> S, Self: Sized,

Map sampled values to type S

impl<R: Clone + Zero + One + CheckedAdd + CheckedMul, const DEGREE_PLUS_ONE: usize> EvaluatablePolynomial<Boolean, R> for BinaryU64Poly<DEGREE_PLUS_ONE>

type EvaluationPoint = R

The type of points a polynomial can be evaluated on. For univariate polynomials this typically is Out, for multivariate this is [Out].

fn evaluate_at_point(&self, point: &R) -> Result<R, EvaluationError>

Evaluates the polynomial at the given point.

impl<const DEGREE_PLUS_ONE: usize> From<&BinaryU64Poly<DEGREE_PLUS_ONE>> for BinaryU64Poly<DEGREE_PLUS_ONE>

fn from(value: &BinaryU64Poly<DEGREE_PLUS_ONE>) -> Self

Converts to this type from the input type.

impl<const DEGREE_PLUS_ONE: usize> From<BinaryU64Poly<DEGREE_PLUS_ONE>> for DensePolynomial<Boolean, DEGREE_PLUS_ONE>

fn from(binary_poly: BinaryU64Poly<DEGREE_PLUS_ONE>) -> Self

Converts to this type from the input type.

impl<const DEGREE_PLUS_ONE: usize> From<BinaryU64Poly<DEGREE_PLUS_ONE>> for DynamicPolynomialFS<Boolean>

fn from(binary_poly: BinaryPoly<DEGREE_PLUS_ONE>) -> Self

Converts to this type from the input type.

impl<const DEGREE_PLUS_ONE: usize> From<BinaryU64Poly<DEGREE_PLUS_ONE>> for u64

fn from(binary_poly: BinaryU64Poly<DEGREE_PLUS_ONE>) -> Self

Converts to this type from the input type.

impl From<u32> for BinaryU64Poly<32>

fn from(value: u32) -> Self

Converts to this type from the input type.

impl From<u64> for BinaryU64Poly<64>

fn from(value: u64) -> Self

Converts to this type from the input type.

impl<const DEGREE_PLUS_ONE: usize> FromRef<BinaryU64Poly<DEGREE_PLUS_ONE>> for BinaryU64Poly<DEGREE_PLUS_ONE>

fn from_ref(poly: &BinaryU64Poly<DEGREE_PLUS_ONE>) -> Self

impl<R, const DEGREE_PLUS_ONE: usize> FromRef<BinaryU64Poly<DEGREE_PLUS_ONE>> for DensePolynomial<R, DEGREE_PLUS_ONE>

where R: Semiring + FromRef<Boolean> + Default,

fn from_ref(value: &BinaryU64Poly<DEGREE_PLUS_ONE>) -> Self

impl<const DEGREE_PLUS_ONE: usize> GenTranscribable for BinaryU64Poly<DEGREE_PLUS_ONE>

fn read_transcription_bytes_exact(bytes: &[u8]) -> Self

Creates a new instance from a byte buffer. The buffer must be exactly the expected length.

fn write_transcription_bytes_exact(&self, buf: &mut [u8])

Transcribes the current instance into a byte buffer. The buffer must be exactly the expected length.

impl<const DEGREE_PLUS_ONE: usize> Hash for BinaryU64Poly<DEGREE_PLUS_ONE>

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

Feeds this value into the given Hasher.

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

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<Rhs, Out, const DEGREE_PLUS_ONE: usize> InnerProduct<BinaryU64Poly<DEGREE_PLUS_ONE>, Rhs, Out> for BinaryU64PolyInnerProduct<Rhs, DEGREE_PLUS_ONE>

where Rhs: Clone, Out: FromRef<Rhs> + CheckedAdd,

fn inner_product<const CHECK: bool>( lhs: &BinaryU64Poly<DEGREE_PLUS_ONE>, rhs: &[Rhs], zero: Out, ) -> Result<Out, InnerProductError>

The main entry point for the inner product. CHECK determines whether the implementation should check for overflow.

impl<'a, const DEGREE_PLUS_ONE: usize> Mul<&'a BinaryU64Poly<DEGREE_PLUS_ONE>> for BinaryU64Poly<DEGREE_PLUS_ONE>

type Output = BinaryU64Poly<DEGREE_PLUS_ONE>

The resulting type after applying the * operator.

fn mul(self, _rhs: &'a Self) -> Self::Output

Performs the * operation.

impl<const DEGREE_PLUS_ONE: usize> Mul for BinaryU64Poly<DEGREE_PLUS_ONE>

type Output = BinaryU64Poly<DEGREE_PLUS_ONE>

The resulting type after applying the * operator.

fn mul(self, rhs: Self) -> Self::Output

Performs the * operation.

impl<'a, const DEGREE_PLUS_ONE: usize> MulAssign<&'a BinaryU64Poly<DEGREE_PLUS_ONE>> for BinaryU64Poly<DEGREE_PLUS_ONE>

fn mul_assign(&mut self, _rhs: &'a Self)

Performs the *= operation.

impl<const DEGREE_PLUS_ONE: usize> MulAssign for BinaryU64Poly<DEGREE_PLUS_ONE>

fn mul_assign(&mut self, _rhs: Self)

Performs the *= operation.

impl<const DEGREE_PLUS_ONE: usize> MulByScalar<&i64, DensePolynomial<i64, DEGREE_PLUS_ONE>> for BinaryU64Poly<DEGREE_PLUS_ONE>

fn mul_by_scalar<const CHECK: bool>( &self, rhs: &i64, ) -> Option<DensePolynomial<i64, DEGREE_PLUS_ONE>>

Multiplies the current element by a scalar from the right (usually - a coefficient to obtain a linear combination). Returns None if the multiplication would overflow.

impl<const DEGREE_PLUS_ONE: usize> Named for BinaryU64Poly<DEGREE_PLUS_ONE>

fn type_name() -> String

Returns the name of the type as a string, used in benchmarks for nicer output.

impl<const DEGREE_PLUS_ONE: usize> One for BinaryU64Poly<DEGREE_PLUS_ONE>

fn one() -> Self

Returns the multiplicative identity element of Self, 1.

fn set_one(&mut self)

Sets self to the multiplicative identity element of Self, 1.

fn is_one(&self) -> bool

where Self: PartialEq,

Returns true if self is equal to the multiplicative identity.

impl<const DEGREE_PLUS_ONE: usize> PartialEq for BinaryU64Poly<DEGREE_PLUS_ONE>

fn eq(&self, other: &BinaryU64Poly<DEGREE_PLUS_ONE>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<const DEGREE_PLUS_ONE: usize> Polynomial<Boolean> for BinaryU64Poly<DEGREE_PLUS_ONE>

const DEGREE_BOUND: usize = DensePolynomial<Boolean, DEGREE_PLUS_ONE>::DEGREE_BOUND

impl<'a, const DEGREE_PLUS_ONE: usize> Product<&'a BinaryU64Poly<DEGREE_PLUS_ONE>> for BinaryU64Poly<DEGREE_PLUS_ONE>

fn product<I: Iterator<Item = &'a Self>>(iter: I) -> Self

Takes an iterator and generates Self from the elements by multiplying the items.

impl<F, const DEGREE_PLUS_ONE: usize> ProjectableToField<F> for BinaryU64Poly<DEGREE_PLUS_ONE>

where F: PrimeField + FromRef<F> + 'static,

fn prepare_projection(sampled_value: &F) -> impl Fn(&Self) -> F + 'static

Prepare a projection function that will project the current type to a prime field using the given sampled value.

impl<'a, const DEGREE_PLUS_ONE: usize> Sub<&'a BinaryU64Poly<DEGREE_PLUS_ONE>> for BinaryU64Poly<DEGREE_PLUS_ONE>

type Output = BinaryU64Poly<DEGREE_PLUS_ONE>

The resulting type after applying the - operator.

fn sub(self, rhs: &'a Self) -> Self::Output

Performs the - operation.

impl<const DEGREE_PLUS_ONE: usize> Sub for BinaryU64Poly<DEGREE_PLUS_ONE>

type Output = BinaryU64Poly<DEGREE_PLUS_ONE>

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Self::Output

Performs the - operation.

impl<'a, const DEGREE_PLUS_ONE: usize> SubAssign<&'a BinaryU64Poly<DEGREE_PLUS_ONE>> for BinaryU64Poly<DEGREE_PLUS_ONE>

fn sub_assign(&mut self, rhs: &'a Self)

Performs the -= operation.

impl<const DEGREE_PLUS_ONE: usize> SubAssign for BinaryU64Poly<DEGREE_PLUS_ONE>

fn sub_assign(&mut self, rhs: Self)

Performs the -= operation.

impl<'a, const DEGREE_PLUS_ONE: usize> Sum<&'a BinaryU64Poly<DEGREE_PLUS_ONE>> for BinaryU64Poly<DEGREE_PLUS_ONE>

fn sum<I: Iterator<Item = &'a Self>>(iter: I) -> Self

Takes an iterator and generates Self from the elements by “summing up” the items.

impl<const DEGREE_PLUS_ONE: usize> Zero for BinaryU64Poly<DEGREE_PLUS_ONE>

fn zero() -> Self

Returns the additive identity element of Self, 0.

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.

fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.

impl<const DEGREE_PLUS_ONE: usize> Eq for BinaryU64Poly<DEGREE_PLUS_ONE>

impl<const DEGREE_PLUS_ONE: usize> Semiring for BinaryU64Poly<DEGREE_PLUS_ONE>

impl<const DEGREE_PLUS_ONE: usize> StructuralPartialEq for BinaryU64Poly<DEGREE_PLUS_ONE>