vault backup: 2025-04-01 08:54:49

This commit is contained in:
Marco Realacci 2025-04-01 08:54:49 +02:00
parent 15a8424953
commit dc23bc5c16
2 changed files with 10 additions and 2 deletions

View file

@ -32,3 +32,11 @@ If A wait-free implements binary consensus for n processes, then there exists a
*Proof:*
![[Pasted image 20250401083747.png]]
### CN(Atomic R/W registers) = 1
**Thm:** There exists no wait-free implementation of binary consensus for 2 processes that uses atomic R/W registers.
*Proof:*
Assume by contradiction A wait-free, with processes p and q.
By the previous result, it has an initial bivalent configuration C
- let S be a sequence of operations s.t. C = S(C) is maximally bivalent (i.e., p(S(C)) is 0-valent and q(S(C)) is 1-valent, or viceversa)