Test handling of DKG commitments transactions

This commit is contained in:
Luke Parker 2023-04-23 01:00:46 -04:00
parent af84b7f707
commit 3f6565588f
No known key found for this signature in database
4 changed files with 171 additions and 3 deletions

View file

@ -20,7 +20,7 @@ pub trait Processor: 'static + Send + Sync + Clone {
// TODO: Move this to tests
#[derive(Clone)]
pub struct MemProcessor(Arc<RwLock<VecDeque<Message>>>);
pub struct MemProcessor(pub Arc<RwLock<VecDeque<CoordinatorMessage>>>);
impl MemProcessor {
#[allow(clippy::new_without_default)]
pub fn new() -> MemProcessor {
@ -30,8 +30,8 @@ impl MemProcessor {
#[async_trait::async_trait]
impl Processor for MemProcessor {
async fn send(&mut self, _: CoordinatorMessage) {
todo!()
async fn send(&mut self, msg: CoordinatorMessage) {
self.0.write().unwrap().push_back(msg)
}
async fn recv(&mut self) -> Message {
todo!()

View file

@ -0,0 +1,163 @@
use core::time::Duration;
use zeroize::Zeroizing;
use rand_core::{RngCore, OsRng};
use ciphersuite::{group::ff::Field, Ciphersuite, Ristretto};
use schnorr::SchnorrSignature;
use frost::Participant;
use tokio::time::sleep;
use serai_db::MemDb;
use processor_messages::{
key_gen::{self, KeyGenId},
CoordinatorMessage,
};
use tributary::{Signed, Transaction as TransactionTrait, Tributary};
use crate::{
processor::MemProcessor,
LocalP2p,
tributary::{TributaryDb, Transaction, TributarySpec, scanner::handle_new_blocks},
tests::tributary::{new_keys, new_spec, new_tributaries, run_tributaries},
};
#[tokio::test]
async fn dkg_commitments_test() {
let keys = new_keys(&mut OsRng);
let spec = new_spec(&mut OsRng, &keys);
let mut tributaries = new_tributaries(&keys, &spec).await;
// Run the tributaries in the background
tokio::spawn(run_tributaries(tributaries.clone()));
let mut txs = vec![];
// Create DKG commitments for each key
for key in &keys {
let pub_key = Ristretto::generator() * **key;
let attempt = 0;
let mut commitments = vec![0; 256];
OsRng.fill_bytes(&mut commitments);
// Create the TX with a null signature so we can get its sig hash
let tx = Transaction::DkgCommitments(
attempt,
commitments.clone(),
Signed {
signer: pub_key,
nonce: 0,
signature: SchnorrSignature::<Ristretto> {
R: Ristretto::generator(),
s: <Ristretto as Ciphersuite>::F::ZERO,
},
},
);
// Re-create it with the actual signature
// We could mutate the existing one, we'd just have to match to the DkgCommitments enum variant
txs.push(Transaction::DkgCommitments(
attempt,
commitments,
Signed {
signer: pub_key,
nonce: 0,
signature: SchnorrSignature::<Ristretto>::sign(
key,
Zeroizing::new(<Ristretto as Ciphersuite>::F::random(&mut OsRng)),
tx.sig_hash(spec.genesis()),
),
},
));
}
let mut last_block = tributaries[0].1.tip();
// Publish all commitments but one
for (i, tx) in txs.iter().enumerate().skip(1) {
assert!(tributaries[i].1.add_transaction(tx.clone()).await);
}
// Wait until these were included
let mut included = 0;
while included != (txs.len() - 1) {
let tributary = &tributaries[0].1;
let tip = tributary.tip();
if tip == last_block {
sleep(Duration::from_secs(1)).await;
continue;
}
last_block = tip;
included += tributary.block(&last_block).unwrap().transactions.len();
}
let expected_msg = CoordinatorMessage::KeyGen(key_gen::CoordinatorMessage::Commitments {
id: KeyGenId { set: spec.set(), attempt: 0 },
commitments: txs
.iter()
.enumerate()
.map(|(i, tx)| {
if let Transaction::DkgCommitments(_, commitments, _) = tx {
(Participant::new((i + 1).try_into().unwrap()).unwrap(), commitments.clone())
} else {
panic!("txs had non-commitments");
}
})
.collect(),
});
async fn new_processor(
key: &Zeroizing<<Ristretto as Ciphersuite>::F>,
spec: &TributarySpec,
tributary: &Tributary<MemDb, Transaction, LocalP2p>,
) -> (TributaryDb<MemDb>, MemProcessor, [u8; 32]) {
let mut scanner_db = TributaryDb(MemDb::new());
let mut processor = MemProcessor::new();
let mut last_block = tributary.genesis();
handle_new_blocks(&mut scanner_db, key, &mut processor, spec, tributary, &mut last_block).await;
assert!(last_block != tributary.genesis());
(scanner_db, processor, last_block)
}
{
// Instantiate a scanner and verify it has nothing to report
let (mut scanner_db, mut processor, mut last_block) =
new_processor(&keys[0], &spec, &tributaries[0].1).await;
assert!(processor.0.read().unwrap().is_empty());
// Publish the last commitment
assert!(tributaries[0].1.add_transaction(txs[0].clone()).await);
sleep(Duration::from_secs(
(2 * Tributary::<MemDb, Transaction, LocalP2p>::block_time()).into(),
))
.await;
// Verify the scanner emits a KeyGen::Commitments message
handle_new_blocks(
&mut scanner_db,
&keys[0],
&mut processor,
&spec,
&tributaries[0].1,
&mut last_block,
)
.await;
let mut msgs = processor.0.write().unwrap();
assert_eq!(msgs.pop_front().unwrap(), expected_msg);
assert!(msgs.is_empty());
}
// Verify all keys exhibit this scanner behavior
for (i, key) in keys.iter().enumerate() {
let (_, processor, _) = new_processor(key, &spec, &tributaries[i].1).await;
let mut msgs = processor.0.write().unwrap();
assert_eq!(msgs.pop_front().unwrap(), expected_msg);
assert!(msgs.is_empty());
}
}

View file

@ -14,6 +14,8 @@ pub use chain::*;
mod tx;
mod dkg;
fn random_u32<R: RngCore>(rng: &mut R) -> u32 {
u32::try_from(rng.next_u64() >> 32).unwrap()
}

View file

@ -92,6 +92,9 @@ async fn handle_block<D: Db, Pro: Processor, P: P2p>(
todo!();
}
// TODO: We can also full slash if shares before all commitments, or share before the
// necessary preprocesses
// Store this data
let received = TributaryDb::<D>::set_data(
label,