Understanding Byzantine Failures in Distributed Systems
What is a distributed system?
Which of the following is the most severe type of failure in a distributed system?
What is the main goal of the Byzantine Generals' Problem?
In the context of the Byzantine Generals' Problem, if there are 'n' generals and 't' traitors, what is the condition to guarantee a solution?
What is Byzantine Fault Tolerance (BFT)?
Which of the following is a well-known BFT algorithm?
In PBFT, how many identical replies must a client receive to accept a result, if there are 't' faulty nodes?
Why are Byzantine failures a major concern in blockchain technology?
What happens in a BFT system if the number of faulty nodes 't' is such that n <= 3t?