Problem is not with full addresses, the problem is with vanity engine searching for prefixes, when we input 7-10 characters to find a match, it has to perform a double hash which according to Evillo's
benchmarking, a double hash takes around 5% of the whole speed, while 5% might be a fraction of hundreds of MK/s for some, but imagine those running with 1MK/s, your tiny 5% is equal to 50 people with 1MK/s, given you only have one card with a speed of 1000MK/s.
However those discussions are irrelevant now because brute force is not the answer, what we need to focus on is finding mathematical shortcuts which I believe already exist, we haven't looked hard enough yet.