vault backup: 2025-03-31 09:57:33

Concurrent Systems/notes/9 - Consensus.md

@@ -111,7 +111,9 @@ local simulation of Z by p_i
 			k++
 			exec_i <- CONS[k].propose(invoc_i)
 			# sto proponendo UNA LISTA di operazioni
-			# solo una vincerà
+			# e propose in pratica me le mette in ordine
+			# così che posso eseguirle nello stesso ordine
+			# degli altri processi
 			for r=1 to |exec_i|
 				⟨z_i,res⟩ -> 𝛿(z_i,𝜋1(exec_i[r]))
 				j <- 𝜋2(exec_i[r])
@@ -164,4 +166,5 @@ Three possible ways!
 	- literally cancelling non-determinism, but this is not something we want...
 2. additional consensus objects, one for every element of every list
 3. reuse the same consensus object: for all k, `CONS[k]` not only chooses the list of invocations, but also the final state of every invocation
-	- the proposals should also pre-calculate the next state and propose one
+	- the proposals should also pre-calculate the next state and propose one
+