Algorithm properties. We say that a value v and a value v′ conflict if v = v′ and v.sender = v′.sender. Given a set of values we say that the set is conflicting if it contains two conflicting values.
Appears in 3 contracts
Samples: Byzantine Generalized Lattice Agreement, Byzantine Generalized Lattice Agreement, Byzantine Generalized Lattice Agreement
Algorithm properties. ƒ We say that a value v and a value v′ vj conflict if v = v′ vj and v.sender = v′.sendervj.sender. Given a set of values we say that the set is conflicting if it contains two conflicting values.
Appears in 1 contract