marcorealacci/master-degree-notes
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

vault backup: 2025-03-31 17:49:17

Browse source
This commit is contained in:
Marco Realacci 2025-03-31 17:49:17 +02:00
parent 03255d0eb1
commit 47d014e2fb
1 changed files with 3 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

5
Concurrent Systems/notes/9 - Consensus.md
View file

@ -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 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) := 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 for k=1 to h do
P <- {PROP[j][k] | PROP[j]≠⊥ ∧ PROP[j][1..k-1]=res[1..k-1]} P <- {PROP[j][k] | PROP[j]≠⊥ ∧ PROP[j][1..k-1]=res[1..k-1]}
let b be an element of P let b be an element of P