pub struct Pedersen<E, const NUM_BITS: u8>where
    E: Environment,{ /* private fields */ }
Expand description

Pedersen is a collision-resistant hash function that takes a variable-length input. The Pedersen hash function does not behave like a random oracle, see Poseidon for one.

Trait Implementations§

source§

impl<E, const NUM_BITS: u8> Commit for Pedersen<E, NUM_BITS>where E: Environment,

source§

fn commit( &self, input: &[<Pedersen<E, NUM_BITS> as Commit>::Input], randomizer: &<Pedersen<E, NUM_BITS> as Commit>::Randomizer ) -> <Pedersen<E, NUM_BITS> as Commit>::Output

Returns the Pedersen commitment of the given input and randomizer as a field element.

§

type Input = Boolean<E>

§

type Output = Field<E>

§

type Randomizer = Scalar<E>

source§

impl<E, const NUM_BITS: u8> CommitUncompressed for Pedersen<E, NUM_BITS>where E: Environment,

source§

fn commit_uncompressed( &self, input: &[<Pedersen<E, NUM_BITS> as CommitUncompressed>::Input], randomizer: &<Pedersen<E, NUM_BITS> as CommitUncompressed>::Randomizer ) -> <Pedersen<E, NUM_BITS> as CommitUncompressed>::Output

Returns the Pedersen commitment of the given input and randomizer as an affine group element.

§

type Input = Boolean<E>

§

type Output = Group<E>

§

type Randomizer = Scalar<E>

source§

impl<E, const NUM_BITS: u8> Hash for Pedersen<E, NUM_BITS>where E: Environment,

source§

fn hash( &self, input: &[<Pedersen<E, NUM_BITS> as Hash>::Input] ) -> <Pedersen<E, NUM_BITS> as Hash>::Output

Returns the Pedersen hash of the given input as a field element.

§

type Input = Boolean<E>

§

type Output = Field<E>

source§

impl<E, const NUM_BITS: u8> HashUncompressed for Pedersen<E, NUM_BITS>where E: Environment,

source§

fn hash_uncompressed( &self, input: &[<Pedersen<E, NUM_BITS> as HashUncompressed>::Input] ) -> <Pedersen<E, NUM_BITS> as HashUncompressed>::Output

Returns the Pedersen hash of the given input as an affine group element.

§

type Input = Boolean<E>

§

type Output = Group<E>

source§

impl<E, const NUM_BITS: u8> Inject for Pedersen<E, NUM_BITS>where E: Environment,

source§

fn new( _mode: Mode, pedersen: <Pedersen<E, NUM_BITS> as Inject>::Primitive ) -> Pedersen<E, NUM_BITS>

Initializes a new instance of Pedersen with the given Pedersen variant.

§

type Primitive = Pedersen<<E as Environment>::Network, NUM_BITS>

source§

fn constant(value: Self::Primitive) -> Selfwhere Self: Sized,

Initializes a constant of the given primitive value.
source§

impl<E, const NUM_BITS: u8> Metrics<dyn Commit<Output = Field<E>, Randomizer = Scalar<E>, Input = Boolean<E>>> for Pedersen<E, NUM_BITS>where E: Environment,

§

type Case = (Vec<Mode, Global>, Vec<Mode, Global>)

source§

fn count( case: &<Pedersen<E, NUM_BITS> as Metrics<dyn Commit<Output = Field<E>, Randomizer = Scalar<E>, Input = Boolean<E>>>>::Case ) -> Count

Returns the number of constants, public inputs, private inputs, and constraints.
source§

impl<E, const NUM_BITS: u8> Metrics<dyn CommitUncompressed<Randomizer = Scalar<E>, Output = Group<E>, Input = Boolean<E>>> for Pedersen<E, NUM_BITS>where E: Environment,

§

type Case = (Vec<Mode, Global>, Vec<Mode, Global>)

source§

fn count( case: &<Pedersen<E, NUM_BITS> as Metrics<dyn CommitUncompressed<Randomizer = Scalar<E>, Output = Group<E>, Input = Boolean<E>>>>::Case ) -> Count

Returns the number of constants, public inputs, private inputs, and constraints.
source§

impl<E, const NUM_BITS: u8> Metrics<dyn Hash<Output = Field<E>, Input = Boolean<E>>> for Pedersen<E, NUM_BITS>where E: Environment,

§

type Case = Vec<Mode, Global>

source§

fn count( case: &<Pedersen<E, NUM_BITS> as Metrics<dyn Hash<Output = Field<E>, Input = Boolean<E>>>>::Case ) -> Count

Returns the number of constants, public inputs, private inputs, and constraints.
source§

impl<E, const NUM_BITS: u8> Metrics<dyn HashUncompressed<Input = Boolean<E>, Output = Group<E>>> for Pedersen<E, NUM_BITS>where E: Environment,

§

type Case = Vec<Mode, Global>

source§

fn count( case: &<Pedersen<E, NUM_BITS> as Metrics<dyn HashUncompressed<Input = Boolean<E>, Output = Group<E>>>>::Case ) -> Count

Returns the number of constants, public inputs, private inputs, and constraints.
source§

impl<E, const NUM_BITS: u8> OutputMode<dyn Commit<Output = Field<E>, Randomizer = Scalar<E>, Input = Boolean<E>>> for Pedersen<E, NUM_BITS>where E: Environment,

§

type Case = (Vec<Mode, Global>, Vec<Mode, Global>)

source§

fn output_mode( parameters: &<Pedersen<E, NUM_BITS> as OutputMode<dyn Commit<Output = Field<E>, Randomizer = Scalar<E>, Input = Boolean<E>>>>::Case ) -> Mode

Returns the mode of the output.
source§

impl<E, const NUM_BITS: u8> OutputMode<dyn CommitUncompressed<Randomizer = Scalar<E>, Output = Group<E>, Input = Boolean<E>>> for Pedersen<E, NUM_BITS>where E: Environment,

§

type Case = (Vec<Mode, Global>, Vec<Mode, Global>)

source§

fn output_mode( parameters: &<Pedersen<E, NUM_BITS> as OutputMode<dyn CommitUncompressed<Randomizer = Scalar<E>, Output = Group<E>, Input = Boolean<E>>>>::Case ) -> Mode

Returns the mode of the output.
source§

impl<E, const NUM_BITS: u8> OutputMode<dyn Hash<Output = Field<E>, Input = Boolean<E>>> for Pedersen<E, NUM_BITS>where E: Environment,

§

type Case = Vec<Mode, Global>

source§

fn output_mode( parameter: &<Pedersen<E, NUM_BITS> as OutputMode<dyn Hash<Output = Field<E>, Input = Boolean<E>>>>::Case ) -> Mode

Returns the mode of the output.
source§

impl<E, const NUM_BITS: u8> OutputMode<dyn HashUncompressed<Input = Boolean<E>, Output = Group<E>>> for Pedersen<E, NUM_BITS>where E: Environment,

§

type Case = Vec<Mode, Global>

source§

fn output_mode( parameter: &<Pedersen<E, NUM_BITS> as OutputMode<dyn HashUncompressed<Input = Boolean<E>, Output = Group<E>>>>::Case ) -> Mode

Returns the mode of the output.

Auto Trait Implementations§

§

impl<E, const NUM_BITS: u8> RefUnwindSafe for Pedersen<E, NUM_BITS>where <E as Environment>::BaseField: UnwindSafe + RefUnwindSafe,

§

impl<E, const NUM_BITS: u8> !Send for Pedersen<E, NUM_BITS>

§

impl<E, const NUM_BITS: u8> !Sync for Pedersen<E, NUM_BITS>

§

impl<E, const NUM_BITS: u8> Unpin for Pedersen<E, NUM_BITS>where <E as Environment>::BaseField: Unpin,

§

impl<E, const NUM_BITS: u8> UnwindSafe for Pedersen<E, NUM_BITS>where <E as Environment>::BaseField: 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,

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