Struct snarkvm_gadgets::algorithms::crh::pedersen::PedersenCRHGadget [−][src]
pub struct PedersenCRHGadget<G: Group, F: Field, GG: GroupGadget<G, F>> { /* fields omitted */ }
Trait Implementations
impl<F: Field, G: Group, GG: GroupGadget<G, F>, S: PedersenSize> CRHGadget<PedersenCRH<G, S>, F> for PedersenCRHGadget<G, F, GG>
impl<F: Field, G: Group, GG: GroupGadget<G, F>, S: PedersenSize> CRHGadget<PedersenCRH<G, S>, F> for PedersenCRHGadget<G, F, GG>
type OutputGadget = GG
type ParametersGadget = PedersenCRHParametersGadget<G, S, F, GG>
fn check_evaluation_gadget<CS: ConstraintSystem<F>>(
cs: CS,
parameters: &Self::ParametersGadget,
input: Vec<UInt8>
) -> Result<Self::OutputGadget, SynthesisError>
impl<G: Clone + Group, F: Clone + Field, GG: Clone + GroupGadget<G, F>> Clone for PedersenCRHGadget<G, F, GG>
impl<G: Clone + Group, F: Clone + Field, GG: Clone + GroupGadget<G, F>> Clone for PedersenCRHGadget<G, F, GG>
impl<G: Debug + Group, F: Debug + Field, GG: Debug + GroupGadget<G, F>> Debug for PedersenCRHGadget<G, F, GG>
impl<G: Debug + Group, F: Debug + Field, GG: Debug + GroupGadget<G, F>> Debug for PedersenCRHGadget<G, F, GG>
impl<F: PrimeField, G: Group, GG: GroupGadget<G, F>, S: PedersenSize> MaskedCRHGadget<PedersenCRH<G, S>, F> for PedersenCRHGadget<G, F, GG>
impl<F: PrimeField, G: Group, GG: GroupGadget<G, F>, S: PedersenSize> MaskedCRHGadget<PedersenCRH<G, S>, F> for PedersenCRHGadget<G, F, GG>
fn check_evaluation_gadget_masked<CS: ConstraintSystem<F>>(
cs: CS,
parameters: &Self::ParametersGadget,
input: Vec<UInt8>,
mask_parameters: &Self::ParametersGadget,
mask: Vec<UInt8>
) -> Result<Self::OutputGadget, SynthesisError>
fn check_evaluation_gadget_masked<CS: ConstraintSystem<F>>(
cs: CS,
parameters: &Self::ParametersGadget,
input: Vec<UInt8>,
mask_parameters: &Self::ParametersGadget,
mask: Vec<UInt8>
) -> Result<Self::OutputGadget, SynthesisError>
Evaluates a masked Pedersen hash on the given input
using the given mask
. The algorithm
is based on the description in https://eprint.iacr.org/2020/190.pdf, which relies on the
homomorphic properties of Pedersen hashes. First, the mask is extended to ensure constant
hardness - for each bit, 0 => 01, 1 => 10. Then, denoting input bits as m_i, mask bits
as p_i and bases as h_i, computes sum of
(g_i * 1[p_i = 0] + g_i^{-1} * 1[p_i = 1])^{m_i \xor p_i} for all i. Finally, the hash of
the mask itself, being sum of h_i^{p_i} for all i, is added to the computed sum. This
algorithm ensures that each bit in the hash is affected by the mask and that the
final hash remains the same as if no mask was used.
fn extend_mask<CS: ConstraintSystem<F>>(
_: CS,
mask: &[UInt8]
) -> Result<Vec<UInt8>, SynthesisError>
fn extend_mask<CS: ConstraintSystem<F>>(
_: CS,
mask: &[UInt8]
) -> Result<Vec<UInt8>, SynthesisError>
Extends the mask such that 0 => 01, 1 => 10.
impl<G: PartialEq + Group, F: PartialEq + Field, GG: PartialEq + GroupGadget<G, F>> PartialEq<PedersenCRHGadget<G, F, GG>> for PedersenCRHGadget<G, F, GG>
impl<G: PartialEq + Group, F: PartialEq + Field, GG: PartialEq + GroupGadget<G, F>> PartialEq<PedersenCRHGadget<G, F, GG>> for PedersenCRHGadget<G, F, GG>
This method tests for self
and other
values to be equal, and is used
by ==
. Read more
This method tests for !=
.
impl<G: Eq + Group, F: Eq + Field, GG: Eq + GroupGadget<G, F>> Eq for PedersenCRHGadget<G, F, GG>
impl<G: Group, F: Field, GG: GroupGadget<G, F>> StructuralPartialEq for PedersenCRHGadget<G, F, GG>
Auto Trait Implementations
impl<G, F, GG> RefUnwindSafe for PedersenCRHGadget<G, F, GG> where
F: RefUnwindSafe,
G: RefUnwindSafe,
GG: RefUnwindSafe,
impl<G, F, GG> !Send for PedersenCRHGadget<G, F, GG>
impl<G, F, GG> !Sync for PedersenCRHGadget<G, F, GG>
impl<G, F, GG> Unpin for PedersenCRHGadget<G, F, GG> where
F: Unpin,
impl<G, F, GG> UnwindSafe for PedersenCRHGadget<G, F, GG> where
F: UnwindSafe,
G: RefUnwindSafe,
GG: RefUnwindSafe,
Blanket Implementations
Mutably borrows from an owned value. Read more
Compare self to key
and return true
if they are equal.
fn fmt_binary(self) -> FmtBinary<Self> where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self> where
Self: Binary,
Causes self
to use its Binary
implementation when Debug
-formatted.
fn fmt_display(self) -> FmtDisplay<Self> where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self> where
Self: Display,
Causes self
to use its Display
implementation when
Debug
-formatted. Read more
fn fmt_lower_exp(self) -> FmtLowerExp<Self> where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self> where
Self: LowerExp,
Causes self
to use its LowerExp
implementation when
Debug
-formatted. Read more
fn fmt_lower_hex(self) -> FmtLowerHex<Self> where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self> where
Self: LowerHex,
Causes self
to use its LowerHex
implementation when
Debug
-formatted. Read more
Causes self
to use its Octal
implementation when Debug
-formatted.
fn fmt_pointer(self) -> FmtPointer<Self> where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self> where
Self: Pointer,
Causes self
to use its Pointer
implementation when
Debug
-formatted. Read more
fn fmt_upper_exp(self) -> FmtUpperExp<Self> where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self> where
Self: UpperExp,
Causes self
to use its UpperExp
implementation when
Debug
-formatted. Read more
fn fmt_upper_hex(self) -> FmtUpperHex<Self> where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self> where
Self: UpperHex,
Causes self
to use its UpperHex
implementation when
Debug
-formatted. Read more
impl<T> Pipe for T where
T: ?Sized,
impl<T> Pipe for T where
T: ?Sized,
Pipes by value. This is generally the method you want to use. Read more
Borrows self
and passes that borrow into the pipe function. Read more
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R where
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R where
R: 'a,
Mutably borrows self
and passes that borrow into the pipe function. Read more
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R where
Self: Borrow<B>,
B: 'a + ?Sized,
R: 'a,
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R where
Self: Borrow<B>,
B: 'a + ?Sized,
R: 'a,
Borrows self
, then passes self.borrow()
into the pipe function. Read more
fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R
) -> R where
Self: BorrowMut<B>,
B: 'a + ?Sized,
R: 'a,
fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R
) -> R where
Self: BorrowMut<B>,
B: 'a + ?Sized,
R: 'a,
Mutably borrows self
, then passes self.borrow_mut()
into the pipe
function. Read more
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R where
Self: AsRef<U>,
R: 'a,
U: 'a + ?Sized,
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R where
Self: AsRef<U>,
R: 'a,
U: 'a + ?Sized,
Borrows self
, then passes self.as_ref()
into the pipe function.
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R where
Self: AsMut<U>,
R: 'a,
U: 'a + ?Sized,
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R where
Self: AsMut<U>,
R: 'a,
U: 'a + ?Sized,
Mutably borrows self
, then passes self.as_mut()
into the pipe
function. Read more
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: Deref<Target = T>,
T: 'a + ?Sized,
R: 'a,
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R where
Self: Deref<Target = T>,
T: 'a + ?Sized,
R: 'a,
Borrows self
, then passes self.deref()
into the pipe function.
type Output = T
type Output = T
Should always be Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow<B>,
B: ?Sized,
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow<B>,
B: ?Sized,
Immutable access to the Borrow<B>
of a value. Read more
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut<B>,
B: ?Sized,
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut<B>,
B: ?Sized,
Mutable access to the BorrowMut<B>
of a value. Read more
Immutable access to the AsRef<R>
view of a value. Read more
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized,
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized,
Mutable access to the AsMut<R>
view of a value. Read more
Immutable access to the Deref::Target
of a value. Read more
Mutable access to the Deref::Target
of a value. Read more
Calls .tap()
only in debug builds, and is erased in release builds.
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
Calls .tap_mut()
only in debug builds, and is erased in release
builds. Read more
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow<B>,
B: ?Sized,
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self where
Self: Borrow<B>,
B: ?Sized,
Calls .tap_borrow()
only in debug builds, and is erased in release
builds. Read more
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut<B>,
B: ?Sized,
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self where
Self: BorrowMut<B>,
B: ?Sized,
Calls .tap_borrow_mut()
only in debug builds, and is erased in release
builds. Read more
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self where
Self: AsRef<R>,
R: ?Sized,
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self where
Self: AsRef<R>,
R: ?Sized,
Calls .tap_ref()
only in debug builds, and is erased in release
builds. Read more
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized,
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self where
Self: AsMut<R>,
R: ?Sized,
Calls .tap_ref_mut()
only in debug builds, and is erased in release
builds. Read more
pub fn vzip(self) -> V