It is well-known that one of the corollaries of the classification of finite simple groups (CFSG) is that every finite simple group can be generated by two elements. In a comment on an answer to an old question, Kevin O'Bryant mentioned that
A group theory guru once told me that this is almost equivalent to the classification, in that the classification could be tremendously simplified if this (every finite simple group can be generated by two elements) could be taken as a lemma.
How does this simplification go?
An ideal answer would of course be one that gives a full proof of the CFSG assuming the $2$-generation property as a hypothesis, but that seems like a lot to ask for (and probably still involves some tedious case-by-case analysis?), so perhaps more reasonable is to ask about the broad outline of such a simplification.
As a bonus question, is there anything specific about $2$-generation here, or would it suffice to know that there exists some $k \geq 2$ such that every finite simple group can be generated by $k$ elements in order to achieve (some) simplification of the proof of the CFSG?