-
Notifications
You must be signed in to change notification settings - Fork 23
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
facilitate timeout faults #65
Comments
As discussed, we can respond to the |
As discussed, there is the following problem: Let A, B and C. Each needs to send bcasts. When R1 starts, each party has already self-delivered his bcast to himself, so their states is A sends bcast: B sends bcast: One way to avoid that is to remove self delivery from tofn and rely on the broker (axelar-core) to send our message back to us. |
What is the best fit for crimes associated with timeouts?
|
Actually we should do opt 3 because all p2p message types already include a |
Agreed |
As discussed, we have two tasks to facilitate timeout fault processing:
expecting_more_msgs_this_round
so that (i) it is the same for all parties, and (ii) it returnsfalse
only when we have received messages from all parties. Example: Currently, Alice might proceed to the next round even if she has not yet seen a p2p message from Bob to Charlie. Instead, Alice should not proceed until she has received all messages, including those from Bob to Charlie.waiting_on
that returns a list (Vec<Vec<Crime>>
) of shares that have not yet sent the messages we expect them to send. All parties should deduce the same list. Axelar-core will use this list to vote on who has timed out.Assigning to @sdaveas but I can advise on the change to
expecting_more_msgs_this_round
.The text was updated successfully, but these errors were encountered: