The document introduces a Brainf**k interpreter called fast-bf that is the fastest existing Brainf**k interpreter. It benchmarks fast-bf against other interpreters on a Mandelbrot set generating Brainf**k program, showing that fast-bf with just-in-time compilation and optimizations runs over 4 times faster than the next fastest interpreter. The document also provides examples of optimizations performed in fast-bf like replacing multiple increment operations with a single addition and removing unnecessary branching. Faster optimizations and implementations are welcome if they can outperform fast-bf.