It is totally a question of speed i bet that you python script don't get more thant 50 thousand keys per second.
We can do some test in some 32-36 bit range i guess that the fake randomness can beat your proposal
a test:
try this:
in the range
decimals
400000000000000000000000000000000000000000000000000000000000:500000000000000000000000000000000000000000000000000000000000
find an address whose first digits in red match yours.
target=
4975641556000000000000000000000000000000000000000000000000000finds an address whose first red digits match another private key in the same range.
rules: you will only search in the given range,
Let's suppose that we don't know what the private key is.
therefore, we will not be able to reduce the range, nor skip processes to obtain an advantage.
something like a vanity search.
I'm sure that any version of code that uses "real random" will find a match faster than using Random + sequential in your code.
The point of this is to show that we have technical limitations in terms of computing power, so searches that include sequential only slow down the process.
It does work, for small ranges, but it is an obstacle in large numbers.
if you cheat on the test you only cheat yourself.