Correctness Sample Clauses

Correctness. If a process with identifier i performs Broadcast(m) in superround r ≥ T , then every cor- rect process performs Accept(m, i) during superround r.

Correctness. For all ID, if the leader L is honest and all honest parties are activated on ID, all honest parties would output for ID.

Correctness. If Eve is passive, then Pr[kA = kB]= 1.

Correctness. In this section we prove the correctness of transaction execution by proving the following theorem. Theorem 1 Transaction execution preserves Invariant 1. Proof By assumption the invariant held before the execution of a transaction. At all sites where the transaction is not committed, the data values, history log, and reception vectors remain unchanged. Moreover data values, history log, and reception vectors of all objects not written by the transaction remain unchanged. transaction coordinator.

Correctness. If the dealer is honest and inputs secret m in AVSS-Sh, then: If all honest parties are activated to run AVSS-Sh on ID, all honest parties would output in the AVSS-Sh instance; The value m∗ reconstructed by any honest party in the corresponding AVSS-Rec instance must be equal to m, for all ID.

Correctness. To prove consistency we show that if a correct node Pi outputs vi and a correct node Pj outputs vj then d(vi, vj) ≤ 42δ. From step 4 of Epoch 2 of A-Agree we see that, vi = wi[ki], (64) vj = wj [kj]. (65) From lemma 6 we know that for t < n/4,

Correctness. If both players are honest, then the protocol is correct with probability at least

Correctness. We now prove that the reconciliation algorithm is correct. Correctness means that the value of an object o at commit of reconciliation re ects the timestamp-ordered execution of all the actions executed on o at the reconciling sites, and that Invari- ant 1 still holds.

Correctness. At the conclusion of the protocol, both parties agree on the output. Formally,

Correctness. Honestly generated money states verify under their serial number. That is,