#![cfg(feature = "multisig")] use std::rc::Rc; use rand_core::{RngCore, CryptoRng}; use rand::rngs::OsRng; use ff::Field; use dalek_ff_group::{ED25519_BASEPOINT_TABLE, Scalar, EdwardsPoint}; pub use frost::{ FrostError, MultisigParams, MultisigKeys, key_gen, algorithm::Algorithm, sign::{self, lagrange} }; use monero_serai::frost::Ed25519; pub const THRESHOLD: usize = 5; pub const PARTICIPANTS: usize = 8; #[derive(Clone)] pub struct DummyAlgorithm; impl Algorithm for DummyAlgorithm { type Signature = (); fn addendum_commit_len() -> usize { unimplemented!() } fn preprocess_addendum( _: &mut R, _: &sign::ParamsView, _: &[Scalar; 2], ) -> Vec { unimplemented!() } fn process_addendum( &mut self, _: &sign::ParamsView, _: usize, _: &[EdwardsPoint; 2], _: &[u8], ) -> Result<(), FrostError> { unimplemented!() } fn context(&self) -> Vec { unimplemented!() } fn sign_share( &mut self, _: &sign::ParamsView, _: EdwardsPoint, _: Scalar, _: Scalar, _: &[u8], ) -> Scalar { unimplemented!() } fn verify(&self, _: EdwardsPoint, _: EdwardsPoint, _: Scalar) -> Option { unimplemented!() } fn verify_share( &self, _: EdwardsPoint, _: EdwardsPoint, _: Scalar, ) -> bool { unimplemented!() } } pub fn generate_keys() -> (Vec>>, Scalar) { let mut params = vec![]; let mut machines = vec![]; let mut commitments = vec![vec![]]; for i in 1 ..= PARTICIPANTS { params.push( MultisigParams::new(THRESHOLD, PARTICIPANTS, i).unwrap() ); machines.push( key_gen::StateMachine::::new( params[i - 1], "monero-sign-rs test suite".to_string() ) ); commitments.push(machines[i - 1].generate_coefficients(&mut OsRng).unwrap()); } let mut secret_shares = vec![]; for i in 1 ..= PARTICIPANTS { secret_shares.push( machines[i - 1].generate_secret_shares( &mut OsRng, commitments .iter() .enumerate() .map(|(idx, commitments)| if idx == i { vec![] } else { commitments.to_vec() }) .collect() ).unwrap() ); } let mut keys = vec![]; for i in 1 ..= PARTICIPANTS { let mut our_secret_shares = vec![vec![]]; our_secret_shares.extend( secret_shares.iter().map(|shares| shares[i].clone()).collect::>>() ); keys.push(Rc::new(machines[i - 1].complete(our_secret_shares).unwrap().clone())); } let mut group_private = Scalar::zero(); for i in 1 ..= THRESHOLD { group_private += keys[i - 1].secret_share() * lagrange::( i, &(1 ..= THRESHOLD).collect::>() ); } assert_eq!(&ED25519_BASEPOINT_TABLE * group_private, keys[0].group_key()); (keys, group_private) } #[allow(dead_code)] // Currently has some false positive pub fn sign>( machines: &mut Vec, keys: Vec>> ) -> Vec { assert!(machines.len() >= THRESHOLD); assert!(keys.len() >= machines.len()); let mut commitments = Vec::with_capacity(PARTICIPANTS + 1); commitments.resize(PARTICIPANTS + 1, None); for i in 1 ..= THRESHOLD { commitments[i] = Some(machines[i - 1].preprocess(&mut OsRng).unwrap()); } let mut shares = Vec::with_capacity(PARTICIPANTS + 1); shares.resize(PARTICIPANTS + 1, None); for i in 1 ..= THRESHOLD { shares[i] = Some( machines[i - 1].sign( &commitments .iter() .enumerate() .map(|(idx, value)| if idx == i { None } else { value.to_owned() }) .collect::>>>(), &vec![] ).unwrap() ); } let mut res = Vec::with_capacity(THRESHOLD); for i in 1 ..= THRESHOLD { res.push( machines[i - 1].complete( &shares .iter() .enumerate() .map(|(idx, value)| if idx == i { None } else { value.to_owned() }) .collect::>>>() ).unwrap() ); } res }