mirror of
https://github.com/serai-dex/serai.git
synced 2024-12-28 06:29:38 +00:00
880565cb81
Some checks failed
Coordinator Tests / build (push) Has been cancelled
crypto/ Tests / test-crypto (push) Has been cancelled
Full Stack Tests / build (push) Has been cancelled
Lint / clippy (macos-13) (push) Has been cancelled
Lint / clippy (macos-14) (push) Has been cancelled
Lint / clippy (ubuntu-latest) (push) Has been cancelled
Lint / clippy (windows-latest) (push) Has been cancelled
Lint / deny (push) Has been cancelled
Lint / fmt (push) Has been cancelled
Lint / machete (push) Has been cancelled
Message Queue Tests / build (push) Has been cancelled
Monero Tests / unit-tests (push) Has been cancelled
Reproducible Runtime / build (push) Has been cancelled
Tests / test-infra (push) Has been cancelled
common/ Tests / test-common (push) Has been cancelled
Monero Tests / integration-tests (v0.17.3.2) (push) Has been cancelled
Monero Tests / integration-tests (v0.18.2.0) (push) Has been cancelled
networks/ Tests / test-networks (push) Has been cancelled
no-std build / build (push) Has been cancelled
Processor Tests / build (push) Has been cancelled
Tests / test-substrate (push) Has been cancelled
Tests / test-serai-client (push) Has been cancelled
Preserves the fn accessors within the Monero crates so that we can use statics in some cfgs yet not all (in order to provide support for more low-memory devices) with the exception of `H` (which truly should be cached).
249 lines
7.7 KiB
Rust
249 lines
7.7 KiB
Rust
#![cfg_attr(docsrs, feature(doc_auto_cfg))]
|
|
#![doc = include_str!("../README.md")]
|
|
#![deny(missing_docs)]
|
|
#![cfg_attr(not(feature = "std"), no_std)]
|
|
|
|
use std_shims::{io, vec::Vec};
|
|
#[cfg(feature = "std")]
|
|
use std_shims::sync::LazyLock;
|
|
|
|
use zeroize::{Zeroize, ZeroizeOnDrop};
|
|
|
|
use sha3::{Digest, Keccak256};
|
|
use curve25519_dalek::{
|
|
constants::ED25519_BASEPOINT_POINT,
|
|
traits::VartimePrecomputedMultiscalarMul,
|
|
scalar::Scalar,
|
|
edwards::{EdwardsPoint, VartimeEdwardsPrecomputation},
|
|
};
|
|
|
|
use monero_io::*;
|
|
use monero_generators::H;
|
|
|
|
mod unreduced_scalar;
|
|
pub use unreduced_scalar::UnreducedScalar;
|
|
|
|
#[cfg(test)]
|
|
mod tests;
|
|
|
|
// On std, we cache some variables in statics.
|
|
#[cfg(feature = "std")]
|
|
static INV_EIGHT_CELL: LazyLock<Scalar> = LazyLock::new(|| Scalar::from(8u8).invert());
|
|
/// The inverse of 8 over l, the prime factor of the order of Ed25519.
|
|
#[cfg(feature = "std")]
|
|
#[allow(non_snake_case)]
|
|
pub fn INV_EIGHT() -> Scalar {
|
|
*INV_EIGHT_CELL
|
|
}
|
|
// In no-std environments, we prefer the reduced memory use and calculate it ad-hoc.
|
|
/// The inverse of 8 over l, the prime factor of the order of Ed25519.
|
|
#[cfg(not(feature = "std"))]
|
|
#[allow(non_snake_case)]
|
|
pub fn INV_EIGHT() -> Scalar {
|
|
Scalar::from(8u8).invert()
|
|
}
|
|
|
|
#[cfg(feature = "std")]
|
|
static G_PRECOMP_CELL: LazyLock<VartimeEdwardsPrecomputation> =
|
|
LazyLock::new(|| VartimeEdwardsPrecomputation::new([ED25519_BASEPOINT_POINT]));
|
|
/// A cached (if std) pre-computation of the Ed25519 generator, G.
|
|
#[cfg(feature = "std")]
|
|
#[allow(non_snake_case)]
|
|
pub fn G_PRECOMP() -> &'static VartimeEdwardsPrecomputation {
|
|
&G_PRECOMP_CELL
|
|
}
|
|
/// A cached (if std) pre-computation of the Ed25519 generator, G.
|
|
#[cfg(not(feature = "std"))]
|
|
#[allow(non_snake_case)]
|
|
pub fn G_PRECOMP() -> VartimeEdwardsPrecomputation {
|
|
VartimeEdwardsPrecomputation::new([ED25519_BASEPOINT_POINT])
|
|
}
|
|
|
|
/// The Keccak-256 hash function.
|
|
pub fn keccak256(data: impl AsRef<[u8]>) -> [u8; 32] {
|
|
Keccak256::digest(data.as_ref()).into()
|
|
}
|
|
|
|
/// Hash the provided data to a scalar via keccak256(data) % l.
|
|
///
|
|
/// This function panics if it finds the Keccak-256 preimage for [0; 32].
|
|
pub fn keccak256_to_scalar(data: impl AsRef<[u8]>) -> Scalar {
|
|
let scalar = Scalar::from_bytes_mod_order(keccak256(data.as_ref()));
|
|
// Monero will explicitly error in this case
|
|
// This library acknowledges its practical impossibility of it occurring, and doesn't bother to
|
|
// code in logic to handle it. That said, if it ever occurs, something must happen in order to
|
|
// not generate/verify a proof we believe to be valid when it isn't
|
|
assert!(scalar != Scalar::ZERO, "ZERO HASH: {:?}", data.as_ref());
|
|
scalar
|
|
}
|
|
|
|
/// Transparent structure representing a Pedersen commitment's contents.
|
|
#[allow(non_snake_case)]
|
|
#[derive(Clone, PartialEq, Eq, Zeroize, ZeroizeOnDrop)]
|
|
pub struct Commitment {
|
|
/// The mask for this commitment.
|
|
pub mask: Scalar,
|
|
/// The amount committed to by this commitment.
|
|
pub amount: u64,
|
|
}
|
|
|
|
impl core::fmt::Debug for Commitment {
|
|
fn fmt(&self, fmt: &mut core::fmt::Formatter<'_>) -> Result<(), core::fmt::Error> {
|
|
fmt.debug_struct("Commitment").field("amount", &self.amount).finish_non_exhaustive()
|
|
}
|
|
}
|
|
|
|
impl Commitment {
|
|
/// A commitment to zero, defined with a mask of 1 (as to not be the identity).
|
|
pub fn zero() -> Commitment {
|
|
Commitment { mask: Scalar::ONE, amount: 0 }
|
|
}
|
|
|
|
/// Create a new Commitment.
|
|
pub fn new(mask: Scalar, amount: u64) -> Commitment {
|
|
Commitment { mask, amount }
|
|
}
|
|
|
|
/// Calculate the Pedersen commitment, as a point, from this transparent structure.
|
|
pub fn calculate(&self) -> EdwardsPoint {
|
|
EdwardsPoint::vartime_double_scalar_mul_basepoint(&Scalar::from(self.amount), &H, &self.mask)
|
|
}
|
|
|
|
/// Write the Commitment.
|
|
///
|
|
/// This is not a Monero protocol defined struct, and this is accordingly not a Monero protocol
|
|
/// defined serialization.
|
|
pub fn write<W: io::Write>(&self, w: &mut W) -> io::Result<()> {
|
|
w.write_all(&self.mask.to_bytes())?;
|
|
w.write_all(&self.amount.to_le_bytes())
|
|
}
|
|
|
|
/// Serialize the Commitment to a `Vec<u8>`.
|
|
///
|
|
/// This is not a Monero protocol defined struct, and this is accordingly not a Monero protocol
|
|
/// defined serialization.
|
|
pub fn serialize(&self) -> Vec<u8> {
|
|
let mut res = Vec::with_capacity(32 + 8);
|
|
self.write(&mut res).unwrap();
|
|
res
|
|
}
|
|
|
|
/// Read a Commitment.
|
|
///
|
|
/// This is not a Monero protocol defined struct, and this is accordingly not a Monero protocol
|
|
/// defined serialization.
|
|
pub fn read<R: io::Read>(r: &mut R) -> io::Result<Commitment> {
|
|
Ok(Commitment::new(read_scalar(r)?, read_u64(r)?))
|
|
}
|
|
}
|
|
|
|
/// Decoy data, as used for producing Monero's ring signatures.
|
|
#[derive(Clone, PartialEq, Eq, Zeroize, ZeroizeOnDrop)]
|
|
pub struct Decoys {
|
|
offsets: Vec<u64>,
|
|
signer_index: u8,
|
|
ring: Vec<[EdwardsPoint; 2]>,
|
|
}
|
|
|
|
impl core::fmt::Debug for Decoys {
|
|
fn fmt(&self, fmt: &mut core::fmt::Formatter<'_>) -> Result<(), core::fmt::Error> {
|
|
fmt
|
|
.debug_struct("Decoys")
|
|
.field("offsets", &self.offsets)
|
|
.field("ring", &self.ring)
|
|
.finish_non_exhaustive()
|
|
}
|
|
}
|
|
|
|
#[allow(clippy::len_without_is_empty)]
|
|
impl Decoys {
|
|
/// Create a new instance of decoy data.
|
|
///
|
|
/// `offsets` are the positions of each ring member within the Monero blockchain, offset from the
|
|
/// prior member's position (with the initial ring member offset from 0).
|
|
pub fn new(offsets: Vec<u64>, signer_index: u8, ring: Vec<[EdwardsPoint; 2]>) -> Option<Self> {
|
|
if (offsets.len() != ring.len()) || (usize::from(signer_index) >= ring.len()) {
|
|
None?;
|
|
}
|
|
Some(Decoys { offsets, signer_index, ring })
|
|
}
|
|
|
|
/// The length of the ring.
|
|
pub fn len(&self) -> usize {
|
|
self.offsets.len()
|
|
}
|
|
|
|
/// The positions of the ring members within the Monero blockchain, as their offsets.
|
|
///
|
|
/// The list is formatted as the position of the first ring member, then the offset from each
|
|
/// ring member to its prior.
|
|
pub fn offsets(&self) -> &[u64] {
|
|
&self.offsets
|
|
}
|
|
|
|
/// The positions of the ring members within the Monero blockchain.
|
|
pub fn positions(&self) -> Vec<u64> {
|
|
let mut res = Vec::with_capacity(self.len());
|
|
res.push(self.offsets[0]);
|
|
for m in 1 .. self.len() {
|
|
res.push(res[m - 1] + self.offsets[m]);
|
|
}
|
|
res
|
|
}
|
|
|
|
/// The index of the signer within the ring.
|
|
pub fn signer_index(&self) -> u8 {
|
|
self.signer_index
|
|
}
|
|
|
|
/// The ring.
|
|
pub fn ring(&self) -> &[[EdwardsPoint; 2]] {
|
|
&self.ring
|
|
}
|
|
|
|
/// The [key, commitment] pair of the signer.
|
|
pub fn signer_ring_members(&self) -> [EdwardsPoint; 2] {
|
|
self.ring[usize::from(self.signer_index)]
|
|
}
|
|
|
|
/// Write the Decoys.
|
|
///
|
|
/// This is not a Monero protocol defined struct, and this is accordingly not a Monero protocol
|
|
/// defined serialization.
|
|
pub fn write(&self, w: &mut impl io::Write) -> io::Result<()> {
|
|
write_vec(write_varint, &self.offsets, w)?;
|
|
w.write_all(&[self.signer_index])?;
|
|
write_vec(
|
|
|pair, w| {
|
|
write_point(&pair[0], w)?;
|
|
write_point(&pair[1], w)
|
|
},
|
|
&self.ring,
|
|
w,
|
|
)
|
|
}
|
|
|
|
/// Serialize the Decoys to a `Vec<u8>`.
|
|
///
|
|
/// This is not a Monero protocol defined struct, and this is accordingly not a Monero protocol
|
|
/// defined serialization.
|
|
pub fn serialize(&self) -> Vec<u8> {
|
|
let mut res =
|
|
Vec::with_capacity((1 + (2 * self.offsets.len())) + 1 + 1 + (self.ring.len() * 64));
|
|
self.write(&mut res).unwrap();
|
|
res
|
|
}
|
|
|
|
/// Read a set of Decoys.
|
|
///
|
|
/// This is not a Monero protocol defined struct, and this is accordingly not a Monero protocol
|
|
/// defined serialization.
|
|
pub fn read(r: &mut impl io::Read) -> io::Result<Decoys> {
|
|
Decoys::new(
|
|
read_vec(read_varint, r)?,
|
|
read_byte(r)?,
|
|
read_vec(|r| Ok([read_point(r)?, read_point(r)?]), r)?,
|
|
)
|
|
.ok_or_else(|| io::Error::other("invalid Decoys"))
|
|
}
|
|
}
|