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 Compared to WTS, an additional challenge to be faced is to prevent adversarial processes from indefinitely postpone the decision correct processes. A uncareful design could allow byzantine proposers 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 − ∀ ∈ ∀ ∈ ∀ ∈ ∅

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 Compared to WTS, an additional challenge to be faced is to prevent adversarial processes from indefinitely postpone the decision correct processes. A uncareful design could allow byzantine proposers 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 − ∀ ∈ ∀ ∈ ∀ ∈ ∅ 2: Batch[ r N] = SvS[ k N] = d Array of value sets, one batch for each round 3: Counter[ r N] = 0 d Array of numbers, one for each round 4: r = 1 5: ts = 0 ∅