for each vertex v∈V: ● For i=1,2,...,M,do: once having received enough information: resolve the i-th update of v and send the result ("Accept Reject")to all neighbors; 6 "enough info"to resolve the i-th update at v:(c) 5 curr-color all adjacent updates before 0 have been resolved and received by v 3a path v1,v2,...,VL #rounds >L T>>安>…>丝>0 which occurs w.p.<(eT/L) #rounds =O(AT+log n)w.h.p.for each vertex v ∈ V: • For do: once having received enough information: resolve the i-th update of v and send the result (“Accept / Reject”) to all neighbors; i = 1,2,…, Mv v 0 t 1 t 2 t 3 t 4 t 5 t 6 t 7 u curr-color = “enough info” to resolve the i-th update at v: (t v i , cv i ) ✓ ✗ all adjacent updates before have been resolved and received by v t v i #rounds > L ∃ a path v1, v2, …, vL T > t v1 i1 > t v2 i2 > ⋯ > t vL iL > 0 which occurs w.p. <(eT/L)L #rounds = O(∆T + log n) w.h.p