Theoremadvanced
Clock synchronization lower bound
Also called Lundelius-Lynch bound.
With message-delay uncertainty u and n processes, the achievable clock skew is at least (1 - 1/n)u, and this is tight.
With message-delay uncertainty u and n processes, the achievable clock skew is at least (1 - 1/n)u, and this is tight.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 1YP4C2 Edit this page History Report an error