Skip to main content
. 2020 Jun 10;20(11):3296. doi: 10.3390/s20113296
Algorithm 2: Decide Fame
1: Process DecFam
2: For every event A ordering from earlier to later on basis of rounds round
3: If A.Witnesses && B.Witnesses && B.round > A.round
4: Else
5:        P ← B.round – A.round
6:  Q ← Witness set events in round
7: B.round −1 // B can see strongly
8: R ← Q
9: containing majority Votes (‘TRUE’ in case of a tie)
10:  F ← Q events with R votes
11: If P = 1
12:  B. Votes
13: Else
14: If P mod J > 0 // for normal rounds
15: If P mod J > 0 // for normal rounds
16: If F > 2*t/3 // take decision when in supermajority
17:  A. Fam← R
18:  B. Votes ← R
19: Break;
20: Else // only Votes
21:  B. Votes ← R
22: Else // Coin Round
23: If S > 2*t/3 // vote if it is a supermajority
24:  B. vote ←   R
25: Else // Coin flipping occurs
26:  B.Votes ← mid bit of B.sign