Let's not make this into a contest, I couldn't care less who writes the friendliest code.
Besides mine is in assembly so likely not friendly at all to most people.

I was not refering to how to collect prefixes, that's exactly the same code as how I collect pow proofs, and is dead simple in any case.
I was talking about any strategy to use those prefixes. They are by definition more complex than linearly scanning a range. GPUs typically don't handle sparse seach spaces efficiently for instance.