From 0656872fa4f69c8aa1a7ed7cbbe717eee8f2c838 Mon Sep 17 00:00:00 2001 From: Marco Realacci Date: Mon, 31 Mar 2025 10:07:33 +0200 Subject: [PATCH] vault backup: 2025-03-31 10:07:33 --- Concurrent Systems/notes/9 - Consensus.md | 8 ++++++++ 1 file changed, 8 insertions(+) diff --git a/Concurrent Systems/notes/9 - Consensus.md b/Concurrent Systems/notes/9 - Consensus.md index 313e5c1..235391e 100644 --- a/Concurrent Systems/notes/9 - Consensus.md +++ b/Concurrent Systems/notes/9 - Consensus.md @@ -192,3 +192,11 @@ mv_propose(i,v) := return PROP[k] wait forever ``` +why wait forever? Because we want to prove that it is wait free, but not because the loop finishes. + +##### Validity, Agreement, Integrity, Termination: +- Let $p_{x}$ the first process that writes a proposal +- every $p_i$ that participates to the consensus reads the other proposals after that it has written `PROP[i]` + - all participants starts their for loops after $p_x$ has written its proposal +- every $p_i$ that participates to the consensus finds `PROP[x] != ⊥` in their for loop +- `BC[x]` o \ No newline at end of file