Common use of Algorithm Description Clause in Contracts

Algorithm Description. The pseudocode of GWTS is in Algorithms 3-4. The Generalized Wait Till Safe algorithm is an extension of the WTS algorithm based on the same batching approach proposed in [2]. Input values at proposers are batched until a new decision round starts. Each decision round follows the two-phases approach of WTS. Note that rounds are executed asynchronously at each proposer.2 2The Byzantine reliable broadcast primitive used in [14] is designed to avoid possible confusion of messages in round based algorithms. That is exactly what we need. Algorithm 3 GWTS -Algorithm for proposer process pi 1: proposed value = proi

Appears in 4 contracts

Sources: Byzantine Generalized Lattice Agreement, Byzantine Generalized Lattice Agreement, Byzantine Generalized Lattice Agreement