Why should i check entire range if i know upto 136bit please check start and end hex values mentioned in above post
B0BEA32711DBB7429BA37464FFBB4C8CDA2FFFFFFFFFFFFFFFFFFFFFFFFFFFFF -start
B0BEA32711DBB7429BA37464FFBB4C90901000000000000000000000000000 -end
8CDA2FFFFFFFFFFFFFFFFFFFFFFFFFFFFF
90901000000000000000000000000000
This is actual range
ignoring first part
No of Keys need to be checked :-1262600442496196964774503731383792304129 to be exact
this is the address i am looking for 1Btud1pqADgGzgBCZzxzc2b1o1ytk1HYWC
As you wrote, there are potentially 1262600442496196964774503731383792304129 keys to check. That is the number I used in the calculation to determine the time.
However, there is a way to theoretically optimize it down to 35533089402642672055 keys. That would give you an answer very quickly, but it would require around 1,137,058,861 TB of memory, which is about 4 times the total storage capacity in the world.