Algorithm 3: Order Finding

1: Process FindOrd

2: for every event A

3:  if non-existence of event B for round M in or before round M having B.

4:  witnesses = ‘TRUE’ && B. fam = UNDECIDE && A ϵ ancestor of every round with unique fam witnesses && is ‘FALSE’ of any round before round

5: then

6: A. roundReceive ← M

7: Q ← every event set W so that V ϵ self-ancestor of round unique fam witnesses, && A ϵ ancestor of W not belongs to self-parent of W.

8: consenTime←median of //Consensus Timings Timestamps

9:   for all events in Q

10: return each and every event having roundRecieve not ‘UNDECIDE’, sorted by roundReceive, && ties sorted by consenTime, through white sign