I'm not sure if I've ever proposed this method on this thread before, but I might as well do it now. The method utilises CP during FB just as Briggs 1 and 2 both use and is similar to Roux, but the main thing about this method is that to know it in its entirety you need 28 <RU> algorithms, with one of the algorithms simply being an R and the longest being 11 moves. The steps are as follows:
1. CPFB, 9 moves
2. Triplet at DR. This consists of an E slice edge being placed at DR with 2 corners orientated relative to it, 5 moves.
3. Orientation belt. This is where the algs come in (they require the other E slice edge to be orientated on U), 9 moves.
4. SB while preserving orientation. This uses <R2MU>, 8 moves.
5. LSE, exactly the same as Roux, 13 moves.
Average movecount≈44. Please tell me if any of my numbers are incorrect.
You can find the algs
here.
In terms of speedsolving viability, it's a solid maybe. I don't see anyone getting fast with it or bothering to learn it and I also don't see people pushing it to its limit, but I like it.