Two Clocks: Articulate the two communicating clocks case. How do two processes minimize the error between them and what are the convergence characteristics?

When extending this argument to n-clocks, carry n bits of “witness” to state how reliable a given clock is.

Clearly a newcomer clock with no witnesses should not be given the same weight as an established clock with k witnesses.

But a newcomer clock with one witness that is perfect should have a weight that eventually pulls the group to synchrony.