mirror of
https://github.com/serai-dex/serai.git
synced 2025-12-14 06:59:24 +00:00
* 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.
166 lines
5.6 KiB
Rust
166 lines
5.6 KiB
Rust
use core::time::Duration;
|
|
use std::{sync::Arc, collections::HashSet};
|
|
|
|
use rand_core::OsRng;
|
|
|
|
use ciphersuite::{group::GroupEncoding, Ciphersuite, Ristretto};
|
|
|
|
use tokio::{
|
|
sync::{mpsc, broadcast},
|
|
time::sleep,
|
|
};
|
|
|
|
use serai_db::MemDb;
|
|
|
|
use tributary::Tributary;
|
|
|
|
use crate::{
|
|
tributary::Transaction,
|
|
ActiveTributary, TributaryEvent,
|
|
p2p::{heartbeat_tributaries_task, handle_p2p_task},
|
|
tests::{
|
|
LocalP2p,
|
|
tributary::{new_keys, new_spec, new_tributaries},
|
|
},
|
|
};
|
|
|
|
#[tokio::test]
|
|
async fn sync_test() {
|
|
let mut keys = new_keys(&mut OsRng);
|
|
let spec = new_spec(&mut OsRng, &keys);
|
|
// Ensure this can have a node fail
|
|
assert!(spec.n() > spec.t());
|
|
|
|
let mut tributaries = new_tributaries(&keys, &spec)
|
|
.await
|
|
.into_iter()
|
|
.map(|(_, p2p, tributary)| (p2p, tributary))
|
|
.collect::<Vec<_>>();
|
|
|
|
// Keep a Tributary back, effectively having it offline
|
|
let syncer_key = keys.pop().unwrap();
|
|
let (syncer_p2p, syncer_tributary) = tributaries.pop().unwrap();
|
|
|
|
// Have the rest form a P2P net
|
|
let mut tributary_senders = vec![];
|
|
let mut tributary_arcs = vec![];
|
|
let mut p2p_threads = vec![];
|
|
for (p2p, tributary) in tributaries.drain(..) {
|
|
let tributary = Arc::new(tributary);
|
|
tributary_arcs.push(tributary.clone());
|
|
let (new_tributary_send, new_tributary_recv) = broadcast::channel(5);
|
|
let (cosign_send, _) = mpsc::unbounded_channel();
|
|
let thread = tokio::spawn(handle_p2p_task(p2p, cosign_send, new_tributary_recv));
|
|
new_tributary_send
|
|
.send(TributaryEvent::NewTributary(ActiveTributary { spec: spec.clone(), tributary }))
|
|
.map_err(|_| "failed to send ActiveTributary")
|
|
.unwrap();
|
|
tributary_senders.push(new_tributary_send);
|
|
p2p_threads.push(thread);
|
|
}
|
|
let tributaries = tributary_arcs;
|
|
|
|
// After four blocks of time, we should have a new block
|
|
// We don't wait one block of time as we may have missed the chance for the first block
|
|
// We don't wait two blocks because we may have missed the chance, and then had a failure to
|
|
// propose by our 'offline' validator, which would cause the Tendermint round time to increase,
|
|
// requiring a longer delay
|
|
let block_time = u64::from(Tributary::<MemDb, Transaction, LocalP2p>::block_time());
|
|
sleep(Duration::from_secs(4 * block_time)).await;
|
|
let tip = tributaries[0].tip().await;
|
|
assert!(tip != spec.genesis());
|
|
|
|
// Sleep one second to make sure this block propagates
|
|
sleep(Duration::from_secs(1)).await;
|
|
// Make sure every tributary has it
|
|
for tributary in &tributaries {
|
|
assert!(tributary.reader().block(&tip).is_some());
|
|
}
|
|
|
|
// Now that we've confirmed the other tributaries formed a net without issue, drop the syncer's
|
|
// pending P2P messages
|
|
syncer_p2p.1.write().await.1.last_mut().unwrap().clear();
|
|
|
|
// Have it join the net
|
|
let syncer_key = Ristretto::generator() * *syncer_key;
|
|
let syncer_tributary = Arc::new(syncer_tributary);
|
|
let (syncer_tributary_send, syncer_tributary_recv) = broadcast::channel(5);
|
|
let (cosign_send, _) = mpsc::unbounded_channel();
|
|
tokio::spawn(handle_p2p_task(syncer_p2p.clone(), cosign_send, syncer_tributary_recv));
|
|
syncer_tributary_send
|
|
.send(TributaryEvent::NewTributary(ActiveTributary {
|
|
spec: spec.clone(),
|
|
tributary: syncer_tributary.clone(),
|
|
}))
|
|
.map_err(|_| "failed to send ActiveTributary to syncer")
|
|
.unwrap();
|
|
|
|
// It shouldn't automatically catch up. If it somehow was, our test would be broken
|
|
// Sanity check this
|
|
let tip = tributaries[0].tip().await;
|
|
// Wait until a new block occurs
|
|
sleep(Duration::from_secs(3 * block_time)).await;
|
|
// Make sure a new block actually occurred
|
|
assert!(tributaries[0].tip().await != tip);
|
|
// Make sure the new block alone didn't trigger catching up
|
|
assert_eq!(syncer_tributary.tip().await, spec.genesis());
|
|
|
|
// Start the heartbeat protocol
|
|
let (syncer_heartbeat_tributary_send, syncer_heartbeat_tributary_recv) = broadcast::channel(5);
|
|
tokio::spawn(heartbeat_tributaries_task(syncer_p2p, syncer_heartbeat_tributary_recv));
|
|
syncer_heartbeat_tributary_send
|
|
.send(TributaryEvent::NewTributary(ActiveTributary {
|
|
spec: spec.clone(),
|
|
tributary: syncer_tributary.clone(),
|
|
}))
|
|
.map_err(|_| "failed to send ActiveTributary to heartbeat")
|
|
.unwrap();
|
|
|
|
// The heartbeat is once every 10 blocks, with some limitations
|
|
sleep(Duration::from_secs(20 * block_time)).await;
|
|
assert!(syncer_tributary.tip().await != spec.genesis());
|
|
|
|
// Verify it synced to the tip
|
|
let syncer_tip = {
|
|
let tributary = &tributaries[0];
|
|
|
|
let tip = tributary.tip().await;
|
|
let syncer_tip = syncer_tributary.tip().await;
|
|
// Allow a one block tolerance in case of race conditions
|
|
assert!(
|
|
HashSet::from([tip, tributary.reader().block(&tip).unwrap().parent()]).contains(&syncer_tip)
|
|
);
|
|
syncer_tip
|
|
};
|
|
|
|
sleep(Duration::from_secs(block_time)).await;
|
|
|
|
// Verify it's now keeping up
|
|
assert!(syncer_tributary.tip().await != syncer_tip);
|
|
|
|
// Verify it's now participating in consensus
|
|
// Because only `t` validators are used in a commit, take n - t nodes offline
|
|
// leaving only `t` nodes. Which should force it to participate in the consensus
|
|
// of next blocks.
|
|
let spares = usize::from(spec.n() - spec.t());
|
|
for thread in p2p_threads.iter().take(spares) {
|
|
thread.abort();
|
|
}
|
|
|
|
// wait for a block
|
|
sleep(Duration::from_secs(block_time)).await;
|
|
|
|
if syncer_tributary
|
|
.reader()
|
|
.parsed_commit(&syncer_tributary.tip().await)
|
|
.unwrap()
|
|
.validators
|
|
.iter()
|
|
.any(|signer| signer == &syncer_key.to_bytes())
|
|
{
|
|
return;
|
|
}
|
|
|
|
panic!("synced tributary didn't start participating in consensus");
|
|
}
|