mirror of
https://github.com/serai-dex/serai.git
synced 2024-12-30 15:39:23 +00:00
e4e4245ee3
* Upstream GBP, divisor, circuit abstraction, and EC gadgets from FCMP++ * Initial eVRF implementation Not quite done yet. It needs to communicate the resulting points and proofs to extract them from the Pedersen Commitments in order to return those, and then be tested. * Add the openings of the PCs to the eVRF as necessary * Add implementation of secq256k1 * Make DKG Encryption a bit more flexible No longer requires the use of an EncryptionKeyMessage, and allows pre-defined keys for encryption. * Make NUM_BITS an argument for the field macro * Have the eVRF take a Zeroizing private key * Initial eVRF-based DKG * Add embedwards25519 curve * Inline the eVRF into the DKG library Due to how we're handling share encryption, we'd either need two circuits or to dedicate this circuit to the DKG. The latter makes sense at this time. * Add documentation to the eVRF-based DKG * Add paragraph claiming robustness * Update to the new eVRF proof * Finish routing the eVRF functionality Still needs errors and serialization, along with a few other TODOs. * Add initial eVRF DKG test * Improve eVRF DKG Updates how we calculcate verification shares, improves performance when extracting multiple sets of keys, and adds more to the test for it. * Start using a proper error for the eVRF DKG * Resolve various TODOs Supports recovering multiple key shares from the eVRF DKG. Inlines two loops to save 2**16 iterations. Adds support for creating a constant time representation of scalars < NUM_BITS. * Ban zero ECDH keys, document non-zero requirements * Implement eVRF traits, all the way up to the DKG, for secp256k1/ed25519 * Add Ristretto eVRF trait impls * Support participating multiple times in the eVRF DKG * Only participate once per key, not once per key share * Rewrite processor key-gen around the eVRF DKG Still a WIP. * Finish routing the new key gen in the processor Doesn't touch the tests, coordinator, nor Substrate yet. `cargo +nightly fmt && cargo +nightly-2024-07-01 clippy --all-features -p serai-processor` does pass. * Deduplicate and better document in processor key_gen * Update serai-processor tests to the new key gen * Correct amount of yx coefficients, get processor key gen test to pass * Add embedded elliptic curve keys to Substrate * Update processor key gen tests to the eVRF DKG * Have set_keys take signature_participants, not removed_participants Now no one is removed from the DKG. Only `t` people publish the key however. Uses a BitVec for an efficient encoding of the participants. * Update the coordinator binary for the new DKG This does not yet update any tests. * Add sensible Debug to key_gen::[Processor, Coordinator]Message * Have the DKG explicitly declare how to interpolate its shares Removes the hack for MuSig where we multiply keys by the inverse of their lagrange interpolation factor. * Replace Interpolation::None with Interpolation::Constant Allows the MuSig DKG to keep the secret share as the original private key, enabling deriving FROST nonces consistently regardless of the MuSig context. * Get coordinator tests to pass * Update spec to the new DKG * Get clippy to pass across the repo * cargo machete * Add an extra sleep to ensure expected ordering of `Participation`s * Update orchestration * Remove bad panic in coordinator It expected ConfirmationShare to be n-of-n, not t-of-n. * Improve documentation on functions * Update TX size limit We now no longer have to support the ridiculous case of having 49 DKG participations within a 101-of-150 DKG. It does remain quite high due to needing to _sign_ so many times. It'd may be optimal for parties with multiple key shares to independently send their preprocesses/shares (despite the overhead that'll cause with signatures and the transaction structure). * Correct error in the Processor spec document * Update a few comments in the validator-sets pallet * Send/Recv Participation one at a time Sending all, then attempting to receive all in an expected order, wasn't working even with notable delays between sending messages. This points to the mempool not working as expected... * Correct ThresholdKeys serialization in modular-frost test * Updating existing TX size limit test for the new DKG parameters * Increase time allowed for the DKG on the GH CI * Correct construction of signature_participants in serai-client tests Fault identified by akil. * Further contextualize DkgConfirmer by ValidatorSet Caught by a safety check we wouldn't reuse preprocesses across messages. That raises the question of we were prior reusing preprocesses (reusing keys)? Except that'd have caused a variety of signing failures (suggesting we had some staggered timing avoiding it in practice but yes, this was possible in theory). * Add necessary calls to set_embedded_elliptic_curve_key in coordinator set rotation tests * Correct shimmed setting of a secq256k1 key * cargo fmt * Don't use `[0; 32]` for the embedded keys in the coordinator rotation test The key_gen function expects the random values already decided. * Big-endian secq256k1 scalars Also restores the prior, safer, Encryption::register function.
361 lines
11 KiB
Rust
361 lines
11 KiB
Rust
use core::ops::Deref;
|
|
use std_shims::sync::LazyLock;
|
|
|
|
use zeroize::Zeroizing;
|
|
use rand_core::OsRng;
|
|
|
|
use curve25519_dalek::{constants::ED25519_BASEPOINT_TABLE, scalar::Scalar};
|
|
|
|
use tokio::sync::Mutex;
|
|
|
|
use monero_simple_request_rpc::SimpleRequestRpc;
|
|
use monero_wallet::{
|
|
ringct::RctType,
|
|
transaction::Transaction,
|
|
block::Block,
|
|
rpc::{Rpc, FeeRate},
|
|
address::{Network, AddressType, MoneroAddress},
|
|
DEFAULT_LOCK_WINDOW, ViewPair, GuaranteedViewPair, WalletOutput, Scanner,
|
|
};
|
|
|
|
mod builder;
|
|
pub use builder::SignableTransactionBuilder;
|
|
|
|
pub fn ring_len(rct_type: RctType) -> usize {
|
|
match rct_type {
|
|
RctType::ClsagBulletproof => 11,
|
|
RctType::ClsagBulletproofPlus => 16,
|
|
_ => panic!("ring size unknown for RctType"),
|
|
}
|
|
}
|
|
|
|
pub fn random_address() -> (Scalar, ViewPair, MoneroAddress) {
|
|
let spend = Scalar::random(&mut OsRng);
|
|
let spend_pub = &spend * ED25519_BASEPOINT_TABLE;
|
|
let view = Zeroizing::new(Scalar::random(&mut OsRng));
|
|
(
|
|
spend,
|
|
ViewPair::new(spend_pub, view.clone()).unwrap(),
|
|
MoneroAddress::new(
|
|
Network::Mainnet,
|
|
AddressType::Legacy,
|
|
spend_pub,
|
|
view.deref() * ED25519_BASEPOINT_TABLE,
|
|
),
|
|
)
|
|
}
|
|
|
|
#[allow(unused)]
|
|
pub fn random_guaranteed_address() -> (Scalar, GuaranteedViewPair, MoneroAddress) {
|
|
let spend = Scalar::random(&mut OsRng);
|
|
let spend_pub = &spend * ED25519_BASEPOINT_TABLE;
|
|
let view = Zeroizing::new(Scalar::random(&mut OsRng));
|
|
(
|
|
spend,
|
|
GuaranteedViewPair::new(spend_pub, view.clone()).unwrap(),
|
|
MoneroAddress::new(
|
|
Network::Mainnet,
|
|
AddressType::Legacy,
|
|
spend_pub,
|
|
view.deref() * ED25519_BASEPOINT_TABLE,
|
|
),
|
|
)
|
|
}
|
|
|
|
// TODO: Support transactions already on-chain
|
|
// TODO: Don't have a side effect of mining blocks more blocks than needed under race conditions
|
|
pub async fn mine_until_unlocked(
|
|
rpc: &SimpleRequestRpc,
|
|
addr: &MoneroAddress,
|
|
tx_hash: [u8; 32],
|
|
) -> Block {
|
|
// mine until tx is in a block
|
|
let mut height = rpc.get_height().await.unwrap();
|
|
let mut found = false;
|
|
let mut block = None;
|
|
while !found {
|
|
let inner_block = rpc.get_block_by_number(height - 1).await.unwrap();
|
|
found = match inner_block.transactions.iter().find(|&&x| x == tx_hash) {
|
|
Some(_) => {
|
|
block = Some(inner_block);
|
|
true
|
|
}
|
|
None => {
|
|
height = rpc.generate_blocks(addr, 1).await.unwrap().1 + 1;
|
|
false
|
|
}
|
|
}
|
|
}
|
|
|
|
// Mine until tx's outputs are unlocked
|
|
for _ in 0 .. (DEFAULT_LOCK_WINDOW - 1) {
|
|
rpc.generate_blocks(addr, 1).await.unwrap();
|
|
}
|
|
|
|
block.unwrap()
|
|
}
|
|
|
|
// Mines 60 blocks and returns an unlocked miner TX output.
|
|
#[allow(dead_code)]
|
|
pub async fn get_miner_tx_output(rpc: &SimpleRequestRpc, view: &ViewPair) -> WalletOutput {
|
|
let mut scanner = Scanner::new(view.clone());
|
|
|
|
// Mine 60 blocks to unlock a miner TX
|
|
let start = rpc.get_height().await.unwrap();
|
|
rpc.generate_blocks(&view.legacy_address(Network::Mainnet), 60).await.unwrap();
|
|
|
|
let block = rpc.get_block_by_number(start).await.unwrap();
|
|
scanner
|
|
.scan(rpc.get_scannable_block(block).await.unwrap())
|
|
.unwrap()
|
|
.ignore_additional_timelock()
|
|
.swap_remove(0)
|
|
}
|
|
|
|
/// Make sure the weight and fee match the expected calculation.
|
|
pub fn check_weight_and_fee(tx: &Transaction, fee_rate: FeeRate) {
|
|
let Transaction::V2 { proofs: Some(ref proofs), .. } = tx else { panic!("TX wasn't RingCT") };
|
|
let fee = proofs.base.fee;
|
|
|
|
let weight = tx.weight();
|
|
let expected_weight = fee_rate.calculate_weight_from_fee(fee);
|
|
assert_eq!(weight, expected_weight);
|
|
|
|
let expected_fee = fee_rate.calculate_fee_from_weight(weight);
|
|
assert_eq!(fee, expected_fee);
|
|
}
|
|
|
|
pub async fn rpc() -> SimpleRequestRpc {
|
|
let rpc =
|
|
SimpleRequestRpc::new("http://serai:seraidex@127.0.0.1:18081".to_string()).await.unwrap();
|
|
|
|
const BLOCKS_TO_MINE: usize = 110;
|
|
|
|
// Only run once
|
|
if rpc.get_height().await.unwrap() > BLOCKS_TO_MINE {
|
|
return rpc;
|
|
}
|
|
|
|
let addr = MoneroAddress::new(
|
|
Network::Mainnet,
|
|
AddressType::Legacy,
|
|
&Scalar::random(&mut OsRng) * ED25519_BASEPOINT_TABLE,
|
|
&Scalar::random(&mut OsRng) * ED25519_BASEPOINT_TABLE,
|
|
);
|
|
|
|
// Mine enough blocks to ensure decoy availability
|
|
rpc.generate_blocks(&addr, BLOCKS_TO_MINE).await.unwrap();
|
|
|
|
rpc
|
|
}
|
|
|
|
pub(crate) static SEQUENTIAL: LazyLock<Mutex<()>> = LazyLock::new(|| Mutex::new(()));
|
|
|
|
#[macro_export]
|
|
macro_rules! async_sequential {
|
|
($(async fn $name: ident() $body: block)*) => {
|
|
$(
|
|
#[tokio::test]
|
|
async fn $name() {
|
|
let guard = runner::SEQUENTIAL.lock().await;
|
|
let local = tokio::task::LocalSet::new();
|
|
local.run_until(async move {
|
|
if let Err(err) = tokio::task::spawn_local(async move { $body }).await {
|
|
drop(guard);
|
|
Err(err).unwrap()
|
|
}
|
|
}).await;
|
|
}
|
|
)*
|
|
}
|
|
}
|
|
|
|
#[macro_export]
|
|
macro_rules! test {
|
|
(
|
|
$name: ident,
|
|
(
|
|
$first_tx: expr,
|
|
$first_checks: expr,
|
|
),
|
|
$((
|
|
$tx: expr,
|
|
$checks: expr,
|
|
)$(,)?),*
|
|
) => {
|
|
async_sequential! {
|
|
async fn $name() {
|
|
use core::{ops::Deref, any::Any};
|
|
#[cfg(feature = "multisig")]
|
|
use std::collections::HashMap;
|
|
|
|
use zeroize::Zeroizing;
|
|
use rand_core::{RngCore, OsRng};
|
|
|
|
use curve25519_dalek::{constants::ED25519_BASEPOINT_TABLE, scalar::Scalar};
|
|
|
|
#[cfg(feature = "multisig")]
|
|
use frost::{
|
|
curve::Ed25519,
|
|
Participant,
|
|
tests::{THRESHOLD, key_gen},
|
|
};
|
|
|
|
use monero_wallet::{
|
|
ringct::RctType,
|
|
rpc::FeePriority,
|
|
address::Network,
|
|
ViewPair, Scanner, OutputWithDecoys,
|
|
send::{Change, SignableTransaction, Eventuality},
|
|
};
|
|
|
|
use runner::{
|
|
SignableTransactionBuilder, ring_len, random_address, rpc, mine_until_unlocked,
|
|
get_miner_tx_output, check_weight_and_fee,
|
|
};
|
|
|
|
type Builder = SignableTransactionBuilder;
|
|
|
|
// Run each function as both a single signer and as a multisig
|
|
#[allow(clippy::redundant_closure_call)]
|
|
for multisig in [false, true] {
|
|
// Only run the multisig variant if multisig is enabled
|
|
if multisig {
|
|
#[cfg(not(feature = "multisig"))]
|
|
continue;
|
|
}
|
|
|
|
let spend = Zeroizing::new(Scalar::random(&mut OsRng));
|
|
#[cfg(feature = "multisig")]
|
|
let keys = key_gen::<_, Ed25519>(&mut OsRng);
|
|
|
|
let spend_pub = if !multisig {
|
|
spend.deref() * ED25519_BASEPOINT_TABLE
|
|
} else {
|
|
#[cfg(not(feature = "multisig"))]
|
|
panic!("Multisig branch called without the multisig feature");
|
|
#[cfg(feature = "multisig")]
|
|
keys[&Participant::new(1).unwrap()].group_key().0
|
|
};
|
|
|
|
let rpc = rpc().await;
|
|
|
|
let view_priv = Zeroizing::new(Scalar::random(&mut OsRng));
|
|
let mut outgoing_view = Zeroizing::new([0; 32]);
|
|
OsRng.fill_bytes(outgoing_view.as_mut());
|
|
let view = ViewPair::new(spend_pub, view_priv.clone()).unwrap();
|
|
let addr = view.legacy_address(Network::Mainnet);
|
|
|
|
let miner_tx = get_miner_tx_output(&rpc, &view).await;
|
|
|
|
let rct_type = match rpc.get_hardfork_version().await.unwrap() {
|
|
14 => RctType::ClsagBulletproof,
|
|
15 | 16 => RctType::ClsagBulletproofPlus,
|
|
_ => panic!("unrecognized hardfork version"),
|
|
};
|
|
|
|
let builder = SignableTransactionBuilder::new(
|
|
rct_type,
|
|
outgoing_view,
|
|
Change::new(
|
|
ViewPair::new(
|
|
&Scalar::random(&mut OsRng) * ED25519_BASEPOINT_TABLE,
|
|
Zeroizing::new(Scalar::random(&mut OsRng))
|
|
).unwrap(),
|
|
None,
|
|
),
|
|
rpc.get_fee_rate(FeePriority::Unimportant).await.unwrap(),
|
|
);
|
|
|
|
let sign = |tx: SignableTransaction| {
|
|
let spend = spend.clone();
|
|
#[cfg(feature = "multisig")]
|
|
let keys = keys.clone();
|
|
|
|
assert_eq!(&SignableTransaction::read(&mut tx.serialize().as_slice()).unwrap(), &tx);
|
|
|
|
let eventuality = Eventuality::from(tx.clone());
|
|
|
|
let tx = if !multisig {
|
|
tx.sign(&mut OsRng, &spend).unwrap()
|
|
} else {
|
|
#[cfg(not(feature = "multisig"))]
|
|
panic!("multisig branch called without the multisig feature");
|
|
#[cfg(feature = "multisig")]
|
|
{
|
|
let mut machines = HashMap::new();
|
|
for i in (1 ..= THRESHOLD).map(|i| Participant::new(i).unwrap()) {
|
|
machines.insert(i, tx.clone().multisig(keys[&i].clone()).unwrap());
|
|
}
|
|
|
|
frost::tests::sign_without_caching(&mut OsRng, machines, &[])
|
|
}
|
|
};
|
|
|
|
assert_eq!(&eventuality.extra(), &tx.prefix().extra, "eventuality extra was distinct");
|
|
assert!(eventuality.matches(&tx.clone().into()), "eventuality didn't match");
|
|
|
|
tx
|
|
};
|
|
|
|
// TODO: Generate a distinct wallet for each transaction to prevent overlap
|
|
let next_addr = addr;
|
|
|
|
let temp = Box::new({
|
|
let mut builder = builder.clone();
|
|
|
|
let input = OutputWithDecoys::fingerprintable_deterministic_new(
|
|
&mut OsRng,
|
|
&rpc,
|
|
ring_len(rct_type),
|
|
rpc.get_height().await.unwrap(),
|
|
miner_tx,
|
|
).await.unwrap();
|
|
builder.add_input(input);
|
|
|
|
let (tx, state) = ($first_tx)(rpc.clone(), builder, next_addr).await;
|
|
let fee_rate = tx.fee_rate().clone();
|
|
let signed = sign(tx);
|
|
rpc.publish_transaction(&signed).await.unwrap();
|
|
let block =
|
|
mine_until_unlocked(&rpc, &random_address().2, signed.hash()).await;
|
|
let block = rpc.get_scannable_block(block).await.unwrap();
|
|
let tx = rpc.get_transaction(signed.hash()).await.unwrap();
|
|
check_weight_and_fee(&tx, fee_rate);
|
|
let scanner = Scanner::new(view.clone());
|
|
($first_checks)(rpc.clone(), block, tx, scanner, state).await
|
|
});
|
|
#[allow(unused_variables, unused_mut, unused_assignments)]
|
|
let mut carried_state: Box<dyn Any> = temp;
|
|
|
|
$(
|
|
let (tx, state) = ($tx)(
|
|
rct_type,
|
|
rpc.clone(),
|
|
builder.clone(),
|
|
next_addr,
|
|
*carried_state.downcast().unwrap()
|
|
).await;
|
|
let fee_rate = tx.fee_rate().clone();
|
|
let signed = sign(tx);
|
|
rpc.publish_transaction(&signed).await.unwrap();
|
|
let block =
|
|
mine_until_unlocked(&rpc, &random_address().2, signed.hash()).await;
|
|
let block = rpc.get_scannable_block(block).await.unwrap();
|
|
let tx = rpc.get_transaction(signed.hash()).await.unwrap();
|
|
if stringify!($name) != "spend_one_input_to_two_outputs_no_change" {
|
|
// Skip weight and fee check for the above test because when there is no change,
|
|
// the change is added to the fee
|
|
check_weight_and_fee(&tx, fee_rate);
|
|
}
|
|
#[allow(unused_assignments)]
|
|
{
|
|
let scanner = Scanner::new(view.clone());
|
|
carried_state = Box::new(($checks)(rpc.clone(), block, tx, scanner, state).await);
|
|
}
|
|
)*
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|