Questions tagged [byzantine-fault-tolerance]

Filter by
Sorted by
Tagged with
0 votes
1 answer
75 views

How to find traitor in Byzantine General Problem

I am new to this problem and trying to understand it. For example if I have 7 generals, 4 of them are honest and 3 of them are traitors. Now, how do I know which 4 generals are honest generals because ...
user avatar
  • 101
1 vote
1 answer
56 views

Does Bitcoin network require at least one third honest nodes to be secure?

In byzantine generals problem, it is proved that one third or more generals should be loyal, or the problem is unsolvable from a mathematical standpoint. Does Bitcoin network follow the same rule? How ...
user avatar
  • 23
2 votes
1 answer
71 views

PBFT algorithm - how do we know how many nodes are faulty?

I am reading this article about PBFT and I have trouble understanding how it can be used in practice. If we don't how many nodes are faulty (which I believe is a valid assumption), then how can we ...
user avatar
  • 163
1 vote
0 answers
46 views

Can you call PoW 2f resilient?

Can you call PoW 2f resilient if all nodes would have same hash power? PoW is called eventually consistence. Even in an asynchronous network. The only attack possible is 51% attack. Further, there is ...
user avatar
3 votes
1 answer
699 views

Difference between PoW and BFT

What is the difference PoW algorithms (as used in Bitcoind) and BFT (used for instance in Libra) ?
user avatar
2 votes
0 answers
52 views

How to detect a consensus is BFT or not? [closed]

Can we divide consensus algorithms into BFT (Byzantine Fault Tolerant) and non-BFT ? If so, How to detect a consensus is BFT or non-BFT ? Is there any non-BFT consensus algorithm example ?
user avatar
  • 1,102