Struct BorromeanRange 

pub struct BorromeanRange {
    pub(crate) sigs: BorromeanSignatures,
    pub(crate) bit_commitments: [CompressedPoint; 64],
}

A range proof premised on Borromean ring signatures.

Fields

sigs: BorromeanSignatures

bit_commitments: [CompressedPoint; 64]

Implementations

impl BorromeanRange

pub fn read<R>(r: &mut R) -> Result<BorromeanRange, Error>

where R: Read,

Read a BorromeanRange proof.

pub fn write<W>(&self, w: &mut W) -> Result<(), Error>

where W: Write,

Write the BorromeanRange proof.

pub fn verify(&self, commitment: &CompressedPoint) -> bool

Verify the commitment contains a 64-bit coefficient for the H generator.

This DOES NOT confirm that the result is a Pedersen commitment in the prime-order subgroup, as the Monero protocol does not have such a bound. This MUST only be used as expected by the Monero protocol, with all associated expectations.

Trait Implementations

impl Clone for BorromeanRange

fn clone(&self) -> BorromeanRange

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BorromeanRange

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

Formats the value using the given formatter.

impl Eq for BorromeanRange

#[doc(hidden)]

fn assert_fields_are_eq(&self)

🔬This is a nightly-only experimental API. (derive_eq_internals)

#[doc(hidden)]

fn assert_receiver_is_total_eq(&self)

👎Deprecated since 1.95.0:

implementation detail of #[derive(Eq)]

impl PartialEq for BorromeanRange

fn eq(&self, other: &BorromeanRange) -> 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 StructuralPartialEq for BorromeanRange

impl Zeroize for BorromeanRange

fn zeroize(&mut self)

Zero out this object from memory using Rust intrinsics which ensure the zeroization operation is not “optimized away” by the compiler.