@@ -499,7 +499,7 @@ func (n *Node) waitForSignature(
499499 keepAddress common.Address ,
500500 digest [32 ]byte ,
501501) bool {
502- const waitTimeout = 10 * time .Minute
502+ const waitTimeout = 30 * time .Minute
503503 const checkTick = 1 * time .Minute
504504
505505 ctx , cancelCtx := context .WithTimeout (context .Background (), waitTimeout )
@@ -516,7 +516,7 @@ func (n *Node) waitForSignature(
516516 for {
517517 select {
518518 case <- checkTicker .C :
519- // We check the public key periodically instead of relying on
519+ // We check the signature periodically instead of relying on
520520 // incoming events. The main motivation is that events could not be
521521 // trusted here because they may come from a forked chain or
522522 // the same event can be delivered multiple times.
@@ -663,11 +663,11 @@ func (n *Node) monitorKeepPublicKeySubmission(
663663 // not that serious as for not submitting a signature and to minimize gas
664664 // expenditure in case the current client's pub key has been properly
665665 // registered and we are waiting for someone else, we retry only three times.
666- const maxPubkeyChecksCount = 3
666+ const maxPubkeyChecksCount = 2
667667 // All three operators need to submit public key to the chain so we are
668668 // less aggressive with check ticks than in case of signature submission
669669 // where only one signature is enough.
670- const pubkeyCheckTick = 10 * time .Minute
670+ const pubkeyCheckTick = 60 * time .Minute
671671
672672 pubkeyCheckTicker := time .NewTicker (pubkeyCheckTick )
673673 defer pubkeyCheckTicker .Stop ()
0 commit comments