Brute-force black-box group algorithm for fixed-class nilpotency testing

Idea and outline
The idea is simple: take every tuple of $$c + 1$$ elements of $$G$$ (possibly repeated), and compute their iterated left-normed commutator. If this is the identity for every tuple, then that means that the nilpotency class is at most $$c$$.