mirror of
https://github.com/serai-dex/serai.git
synced 2025-12-08 12:19:24 +00:00
* monero: match monero's stricter check when decompressing points * Reverted type change for output key
173 lines
4.8 KiB
Rust
173 lines
4.8 KiB
Rust
use core::fmt::Debug;
|
|
use std_shims::{
|
|
vec::Vec,
|
|
io::{self, Read, Write},
|
|
};
|
|
|
|
use curve25519_dalek::{scalar::Scalar, edwards::EdwardsPoint};
|
|
|
|
use monero_generators::decompress_point;
|
|
|
|
const VARINT_CONTINUATION_MASK: u8 = 0b1000_0000;
|
|
|
|
mod sealed {
|
|
pub trait VarInt: TryInto<u64> + TryFrom<u64> + Copy {
|
|
const BITS: usize;
|
|
}
|
|
impl VarInt for u8 {
|
|
const BITS: usize = 8;
|
|
}
|
|
impl VarInt for u32 {
|
|
const BITS: usize = 32;
|
|
}
|
|
impl VarInt for u64 {
|
|
const BITS: usize = 64;
|
|
}
|
|
impl VarInt for usize {
|
|
const BITS: usize = core::mem::size_of::<usize>() * 8;
|
|
}
|
|
}
|
|
|
|
// This will panic if the VarInt exceeds u64::MAX
|
|
pub(crate) fn varint_len<U: sealed::VarInt>(varint: U) -> usize {
|
|
let varint_u64: u64 = varint.try_into().map_err(|_| "varint exceeded u64").unwrap();
|
|
((usize::try_from(u64::BITS - varint_u64.leading_zeros()).unwrap().saturating_sub(1)) / 7) + 1
|
|
}
|
|
|
|
pub(crate) fn write_byte<W: Write>(byte: &u8, w: &mut W) -> io::Result<()> {
|
|
w.write_all(&[*byte])
|
|
}
|
|
|
|
// This will panic if the VarInt exceeds u64::MAX
|
|
pub(crate) fn write_varint<W: Write, U: sealed::VarInt>(varint: &U, w: &mut W) -> io::Result<()> {
|
|
let mut varint: u64 = (*varint).try_into().map_err(|_| "varint exceeded u64").unwrap();
|
|
while {
|
|
let mut b = u8::try_from(varint & u64::from(!VARINT_CONTINUATION_MASK)).unwrap();
|
|
varint >>= 7;
|
|
if varint != 0 {
|
|
b |= VARINT_CONTINUATION_MASK;
|
|
}
|
|
write_byte(&b, w)?;
|
|
varint != 0
|
|
} {}
|
|
Ok(())
|
|
}
|
|
|
|
pub(crate) fn write_scalar<W: Write>(scalar: &Scalar, w: &mut W) -> io::Result<()> {
|
|
w.write_all(&scalar.to_bytes())
|
|
}
|
|
|
|
pub(crate) fn write_point<W: Write>(point: &EdwardsPoint, w: &mut W) -> io::Result<()> {
|
|
w.write_all(&point.compress().to_bytes())
|
|
}
|
|
|
|
pub(crate) fn write_raw_vec<T, W: Write, F: Fn(&T, &mut W) -> io::Result<()>>(
|
|
f: F,
|
|
values: &[T],
|
|
w: &mut W,
|
|
) -> io::Result<()> {
|
|
for value in values {
|
|
f(value, w)?;
|
|
}
|
|
Ok(())
|
|
}
|
|
|
|
pub(crate) fn write_vec<T, W: Write, F: Fn(&T, &mut W) -> io::Result<()>>(
|
|
f: F,
|
|
values: &[T],
|
|
w: &mut W,
|
|
) -> io::Result<()> {
|
|
write_varint(&values.len(), w)?;
|
|
write_raw_vec(f, values, w)
|
|
}
|
|
|
|
pub(crate) fn read_bytes<R: Read, const N: usize>(r: &mut R) -> io::Result<[u8; N]> {
|
|
let mut res = [0; N];
|
|
r.read_exact(&mut res)?;
|
|
Ok(res)
|
|
}
|
|
|
|
pub(crate) fn read_byte<R: Read>(r: &mut R) -> io::Result<u8> {
|
|
Ok(read_bytes::<_, 1>(r)?[0])
|
|
}
|
|
|
|
pub(crate) fn read_u16<R: Read>(r: &mut R) -> io::Result<u16> {
|
|
read_bytes(r).map(u16::from_le_bytes)
|
|
}
|
|
|
|
pub(crate) fn read_u32<R: Read>(r: &mut R) -> io::Result<u32> {
|
|
read_bytes(r).map(u32::from_le_bytes)
|
|
}
|
|
|
|
pub(crate) fn read_u64<R: Read>(r: &mut R) -> io::Result<u64> {
|
|
read_bytes(r).map(u64::from_le_bytes)
|
|
}
|
|
|
|
pub(crate) fn read_varint<R: Read, U: sealed::VarInt>(r: &mut R) -> io::Result<U> {
|
|
let mut bits = 0;
|
|
let mut res = 0;
|
|
while {
|
|
let b = read_byte(r)?;
|
|
if (bits != 0) && (b == 0) {
|
|
Err(io::Error::other("non-canonical varint"))?;
|
|
}
|
|
if ((bits + 7) >= U::BITS) && (b >= (1 << (U::BITS - bits))) {
|
|
Err(io::Error::other("varint overflow"))?;
|
|
}
|
|
|
|
res += u64::from(b & (!VARINT_CONTINUATION_MASK)) << bits;
|
|
bits += 7;
|
|
b & VARINT_CONTINUATION_MASK == VARINT_CONTINUATION_MASK
|
|
} {}
|
|
res.try_into().map_err(|_| io::Error::other("VarInt does not fit into integer type"))
|
|
}
|
|
|
|
// All scalar fields supported by monero-serai are checked to be canonical for valid transactions
|
|
// While from_bytes_mod_order would be more flexible, it's not currently needed and would be
|
|
// inaccurate to include now. While casting a wide net may be preferable, it'd also be inaccurate
|
|
// for now. There's also further edge cases as noted by
|
|
// https://github.com/monero-project/monero/issues/8438, where some scalars had an archaic
|
|
// reduction applied
|
|
pub(crate) fn read_scalar<R: Read>(r: &mut R) -> io::Result<Scalar> {
|
|
Option::from(Scalar::from_canonical_bytes(read_bytes(r)?))
|
|
.ok_or_else(|| io::Error::other("unreduced scalar"))
|
|
}
|
|
|
|
pub(crate) fn read_point<R: Read>(r: &mut R) -> io::Result<EdwardsPoint> {
|
|
let bytes = read_bytes(r)?;
|
|
decompress_point(bytes).ok_or_else(|| io::Error::other("invalid point"))
|
|
}
|
|
|
|
pub(crate) fn read_torsion_free_point<R: Read>(r: &mut R) -> io::Result<EdwardsPoint> {
|
|
read_point(r)
|
|
.ok()
|
|
.filter(EdwardsPoint::is_torsion_free)
|
|
.ok_or_else(|| io::Error::other("invalid point"))
|
|
}
|
|
|
|
pub(crate) fn read_raw_vec<R: Read, T, F: Fn(&mut R) -> io::Result<T>>(
|
|
f: F,
|
|
len: usize,
|
|
r: &mut R,
|
|
) -> io::Result<Vec<T>> {
|
|
let mut res = vec![];
|
|
for _ in 0 .. len {
|
|
res.push(f(r)?);
|
|
}
|
|
Ok(res)
|
|
}
|
|
|
|
pub(crate) fn read_array<R: Read, T: Debug, F: Fn(&mut R) -> io::Result<T>, const N: usize>(
|
|
f: F,
|
|
r: &mut R,
|
|
) -> io::Result<[T; N]> {
|
|
read_raw_vec(f, N, r).map(|vec| vec.try_into().unwrap())
|
|
}
|
|
|
|
pub(crate) fn read_vec<R: Read, T, F: Fn(&mut R) -> io::Result<T>>(
|
|
f: F,
|
|
r: &mut R,
|
|
) -> io::Result<Vec<T>> {
|
|
read_raw_vec(f, read_varint(r)?, r)
|
|
}
|