Algorithm 1: Divide Round

1: Process Div Round

2: For Every Event A

3:  M ← Maximum Parent Round for A

4: Else

5:  M ← 1 // no Maximum Parent Round exist

6:  If A > 2t/3 M // A sees more than 2t/3 rounds than M witnesses

7: A.round ← M+1

8:  Else

9:   A.round ← M

10:  A.Witnesses ← no self-parent of A exists

11:  Or (A.round > A.self-parent.round)