diff --git a/Concurrent Systems/notes/9 - Consensus.md b/Concurrent Systems/notes/9 - Consensus.md
index 45474a2..3653b4a 100644
--- a/Concurrent Systems/notes/9 - Consensus.md	
+++ b/Concurrent Systems/notes/9 - Consensus.md	
@@ -214,10 +214,11 @@ Let k be the number of possible proposals and $h = \lceil \log k \rceil$ be the
 IDEA: decide bit by bit the final outcome
 
 ```
-PROP[1..n][1..h] array of n h-bits proposals, all init at ⊥ BC[1..h] array of h binary consensus objects
+PROP[1..n][1..h] array of n h-bits proposals, all init at ⊥
+BC[1..h] array of h binary consensus objects
 
 bmv_propose(i,v) :=
-	PROP[i] <- binary_repr_h(v) # scrivo la rappresentazione binaria
+	PROP[i] <- binary_repr_h(v) # scrivo la rappresentazione binaria di v in PROP
 	for k=1 to h do
 		P <- {PROP[j][k] | PROP[j]≠⊥ ∧ PROP[j][1..k-1]=res[1..k-1]}
 		let b be an element of P