Quote from: odolvlobo on Today at 10:59:35 PM

Quote from: iconbtcx on Today at 04:38:02 PM

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 in my previous post.

However, there might be a way to theoretically optimize it down to 35533089402642672055 keys (see Pollard's kangaroo ECDLP solver). 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 world's total storage capacity.

Neither one has an outgoing transaction

1C8oHWB7htH139na4y8kG4w99MFrepseUv
1Btud1pqADgGzgBCZzxzc2b1o1ytk1HYWC