The dynamic voting algorithm is applied to a network of five sites. The network is partitioned into {A, B, C} and {D, E} after six updates. Two updates have been performed at {A, B, C} before another partition occurs:

{ A : (8,3), D : (6,5) } { B : (8,3), C : (8,3), E : (6,5) }

Clearly, { B, C, E } forms a majority of the latest version (version 8), therefore, further updates are possible. Site E can catch up and get a copy of version 8.

Can D catch up at { A, D }? Why?

If your answer is negative, provide a list of potential problems if D is allowed to catch up.