i mpossibility of c onsensus in
play

I MPOSSIBILITY OF C ONSENSUS IN A SYNCHRONOUS E NVIRONMENTS Ellis - PowerPoint PPT Presentation

Mar 31, 2023 β€’232 likes β€’1.17k views

I MPOSSIBILITY OF C ONSENSUS IN A SYNCHRONOUS E NVIRONMENTS Ellis Michael C ONSENSUS processes, all of which have an input value from some domain. Processes output a value by calling decide ( ). Non-faulty processes continue correctly

  1. I MPOSSIBILITY OF C ONSENSUS IN A SYNCHRONOUS E NVIRONMENTS Ellis Michael

  2. C ONSENSUS π‘œ processes, all of which have an input value from some domain. Processes output a value by calling decide ( 𝑀 ). Non-faulty processes continue correctly executing protocol steps forever. We denote the number of faulty processes 𝑔 . β€’ Agreement: No two correct processes decide di ff erent values. β€’ Integrity: Every correct process decides at most one value, and if a correct process decides a value 𝑀 , some process had 𝑀 as its input. β€’ Termination: Every correct process eventually decides a value.

  3. B INARY C ONSENSUS π‘œ processes, all of which have an input value from {0, 1}. Processes output a value by calling decide ( 𝑀 ). Non-faulty processes continue correctly executing protocol steps forever. We denote the number of faulty processes 𝑔 . Here, we only consider crash failures . β€’ Agreement: No two processes decide di ff erent values. β€’ Integrity: Every process decides at most one value, and if a process decides a value 𝑀 , some process had 𝑀 as its input. β€’ Termination: Every correct process eventually decides a value.

  4. B INARY C ONSENSUS π‘œ processes, all of which have an input value from {0, 1}. Processes output a value by calling decide ( 𝑀 ). Non-faulty processes continue correctly executing protocol steps forever. We denote the number of faulty processes 𝑔 . Here, we only consider crash If you can solve consensus, failures . you can solve binary consensus. β€’ Agreement: No two processes decide di ff erent values. β€’ Integrity: Every process decides at most one value, and if a process decides a value 𝑀 , some process had 𝑀 as its input. β€’ Termination: Every correct process eventually decides a value.

  5. Aside: Both safety and liveness properties are necessary to create a meaningful speci fi cation!

  6. Theorem (FLP Impossibility Result): In an asynchronous environment in which a single process can fail by crashing, there does not exist a protocol which solves binary consensus.

  7. I NTUITION β€’ In an asynchronous setting, failed processes are indistinguishable from slow processes. β€’ Waiting for failed processes will take forever. β€’ Not waiting for slow processes could violate safety.

  8. C OMPUTATION M ODEL β€’ Processes are deterministic I/O automata (just like π‘ž 2 in your labs; timers are just messages sent from process to itself). π‘ž 1 π‘ž 3 Message Buffer π‘ž π‘œ π‘ž 4 (network) ... π‘ž 5

  9. C OMPUTATION M ODEL β€’ Processes are deterministic I/O automata (just like π‘ž 2 in your labs; timers are just messages sent from process to itself). π‘ž 1 π‘ž 3 β€’ They send messages by adding to message bu ff er, a multi-set (i.e., messages aren't duplicated by network). Processes only send fi nitely-many Message Buffer messages in a single step. π‘ž π‘œ π‘ž 4 (network) ... π‘ž 5

  10. C OMPUTATION M ODEL β€’ Processes are deterministic I/O automata (just like π‘ž 2 in your labs; timers are just messages sent from ( 𝑛 , π‘ž 3 ) process to itself). π‘ž 1 π‘ž 3 β€’ They send messages by adding to message bu ff er, a multi-set (i.e., messages aren't duplicated by network). Processes only send fi nitely-many Message Buffer messages in a single step. π‘ž π‘œ π‘ž 4 (network) ... π‘ž 5

  11. C OMPUTATION M ODEL β€’ Processes are deterministic I/O automata (just like π‘ž 2 in your labs; timers are just messages sent from process to itself). π‘ž 1 π‘ž 3 β€’ They send messages by adding to message bu ff er, a multi-set (i.e., messages aren't duplicated by ( 𝑛 , π‘ž 3 ) network). Processes only send fi nitely-many Message Buffer messages in a single step. π‘ž π‘œ π‘ž 4 (network) ... π‘ž 5

  12. C OMPUTATION M ODEL β€’ Processes are deterministic I/O automata (just like π‘ž 2 in your labs; timers are just messages sent from process to itself). ( 𝑛 , π‘ž 3 ) π‘ž 1 π‘ž 3 β€’ They send messages by adding to message bu ff er, a multi-set (i.e., messages aren't duplicated by network). Processes only send fi nitely-many Message Buffer messages in a single step. π‘ž π‘œ π‘ž 4 (network) ... π‘ž 5

  13. C OMPUTATION M ODEL β€’ Processes are deterministic I/O automata (just like π‘ž 2 in your labs; timers are just messages sent from process to itself). π‘ž 1 π‘ž 3 β€’ They send messages by adding to message bu ff er, a multi-set (i.e., messages aren't duplicated by network). Processes only send fi nitely-many Message Buffer messages in a single step. π‘ž π‘œ π‘ž 4 (network) ... π‘ž 5

  14. C OMPUTATION M ODEL β€’ Processes are deterministic I/O automata (just like π‘ž 2 in your labs; timers are just messages sent from process to itself). π‘ž 1 π‘ž 3 β€’ They send messages by adding to message bu ff er, a multi-set (i.e., messages aren't duplicated by network). Processes only send fi nitely-many Message Buffer messages in a single step. π‘ž π‘œ π‘ž 4 (network) β€’ Special empty message, always deliverable to any process (even if there are messages for it in the network). ... π‘ž 5

  15. C OMPUTATION M ODEL β€’ Processes are deterministic I/O automata (just like π‘ž 2 in your labs; timers are just messages sent from process to itself). π‘ž 1 π‘ž 3 β€’ They send messages by adding to message bu ff er, a multi-set (i.e., messages aren't duplicated by βˆ… network). Processes only send fi nitely-many Message Buffer messages in a single step. π‘ž π‘œ π‘ž 4 (network) β€’ Special empty message, always deliverable to any process (even if there are messages for it in the network). ... π‘ž 5

  16. C OMPUTATION M ODEL βˆ… β€’ Processes are deterministic I/O automata (just like π‘ž 2 in your labs; timers are just messages sent from process to itself). π‘ž 1 π‘ž 3 β€’ They send messages by adding to message bu ff er, a multi-set (i.e., messages aren't duplicated by βˆ… network). Processes only send fi nitely-many Message Buffer messages in a single step. π‘ž π‘œ π‘ž 4 (network) β€’ Special empty message, always deliverable to any process (even if there are messages for it in the network). ... π‘ž 5

  17. C OMPUTATION M ODEL β€’ Processes are deterministic I/O automata (just like π‘ž 2 in your labs; timers are just messages sent from process to itself). π‘ž 1 π‘ž 3 β€’ They send messages by adding to message bu ff er, a multi-set (i.e., messages aren't duplicated by βˆ… network). Processes only send fi nitely-many Message Buffer messages in a single step. π‘ž π‘œ π‘ž 4 (network) β€’ Special empty message, always deliverable to any process (even if there are messages for it in the network). ... π‘ž 5

  18. C OMPUTATION M ODEL β€’ Processes are deterministic I/O automata (just like π‘ž 2 in your labs; timers are just messages sent from process to itself). π‘ž 1 π‘ž 3 β€’ They send messages by adding to message bu ff er, a multi-set (i.e., messages aren't duplicated by βˆ… network). Processes only send fi nitely-many Message Buffer messages in a single step. π‘ž π‘œ π‘ž 4 (network) β€’ Special empty message, always deliverable to any process (even if there are messages for it in the network). β€’ Any message sent to a non-faulty processes is ... π‘ž 5 eventually received. (Stronger assumption than usual!)

  19. C OMPUTATION M ODEL β€’ Processes are deterministic I/O automata (just like π‘ž 2 in your labs; timers are just messages sent from process to itself). π‘ž 1 π‘ž 3 β€’ They send messages by adding to message bu ff er, a multi-set (i.e., messages aren't duplicated by βˆ… network). Processes only send fi nitely-many Message Buffer messages in a single step. π‘ž π‘œ π‘ž 4 Makes the impossibility (network) β€’ Special empty message, always deliverable to any result is stronger! process (even if there are messages for it in the network). β€’ Any message sent to a non-faulty processes is ... π‘ž 5 eventually received. (Stronger assumption than usual!)

  20. C ONFIGURATIONS A con fi guration (usually denoted 𝐷 ) consists of the states of all processes and the state of the message bu ff er. An event is the delivery of a single message (or βˆ… ) to a process. An event is applicable to 𝐷 if it is a βˆ… or a message in 𝐷 's message bu ff er. A con fi guration 𝐷ʹ is reachable from 𝐷 if there is a (possibly empty) sequence of applicable events starting from 𝐷 that results in 𝐷ʹ . Con fi guration 𝐷 is decided if at least one process has decided in 𝐷 .

  21. R UNS A run is an in fi nite sequence of events starting from an initial con fi guration. A process is non-faulty in a run if it takes in fi nitely many steps. It is faulty otherwise. A run is admissible if at most one process is faulty and every message sent to a non-faulty process is eventually delivered.

  22. In other words, the FLP theorem states that any protocol for binary consensus either doesn't satisfy safety or allows for an admissible run in which no value is ever decided (i.e., that it doesn't satisfy termination, the liveness property). From now on, we'll consider a safe and live binary consensus protocol and show a contradiction.

  23. V ALENCY By assumption of safety, no con fi guration has 𝐷 processes deciding di ff erent values. 𝐷 is 0-valent if there are decided con fi gurations reachable from 𝐷 that decide 0, but none that decide 1. 1-valency is de fi ned in the analogous way. 0 𝐷 is univalent if it is 0-valent or 1-valent. 𝐷 is bivalent if both 0-deciding and 1-deciding are reachable from 𝐷 .

More recommend