Local variables. For each iteration j, party Pi maintains several variables: • L(j) contains the set of values to which Pi is “locked,” or ⊥ if it is not locked. Pi will not commit to any other set in iteration j if it is locked. • HardLocked(j) ∈ {0, 1} is a boolean variable indicating whether Pi is “hard locked” to the set L(j). When ▇▇ is hard locked to a set, it will commit to the set regardless of any proposal in iteration j. • T (j) records the sets from “valid proposals” received in iteration j. As part of the security proof, we show that the output must always be such a set. Since, apart from the proposal and preround, the protocol only requires parties to exactly compare sets, it is ok to replace the encodings of sets in these rounds with the hash of the set.
Appears in 2 contracts
Sources: Byzantine Agreement, Byzantine Agreement