We demonstrate how to use Lautemann's proof that BPP is in p 2 to exhibit that BPP is in RP PromiseRP. Immediate consequences show that if PromiseRP is easy or if there exist quick hitting set generators then P = BPP. Our proof vastly simpliies the proofs of the later result due to Andreev, Clementi and Rolim and Andreev, Clementi, Rolim and Trevisan. Clementi, Rolim and Trevisan question wheth...