you too busy to judge my opinion bro, look at the WORKING TIME it's say 00:00:00s, i run this command took 5 second to DONE. you know i mean right ?
so why you just think it's so instant ? if this so fast? why you need to run the command manualy, so ?  
Kangaroo 1 second ?


Here's the right RANGE if you mention me about the wrong range.
i have more range nonce about the pubkey 65.

Results,

START RANGE  = 00000000000000000000000000000000000000000000000186053f25c09123e2
END RANGE     = 000000000000000000000000000000000000000000000001ffffffffffffffff
WIDTH RANGE= 00000000000000000000000000000000000000000000000068fae0d84f6eed2b
SUBpoint= (028e1a50d76d381a1354bee348ef60dc7b4ad43cae7eb446673f2771f9033cda, 99cd9a310590c57bfbfac6288ba9e9b340780a1ad2fdd0c1c7dc9498033e7074)
Save work every 180 seconds

FINDpubkey: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b
Cnt:f35000000000001 [1][ 375 ] = 375 MKeys/s x2^27=2^55.55 t:00:00:00
KEY[1]: 0x000000000000000000000000000000000000000000000001a838b13505b26867
   Pub: 0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b
Working time 00:00:00s
Total time 00:00:08s
GPU#0 job finished
GPU#0 thread finished
cuda finished ok

I must admit i gave up seeking solutions for those puzzles. It consumes to much time and gives nothing.

I've tried 125 with BSGS and Kangaroo  ... i've tried 66 in random mode ... and my conclusions is: These numbers are just too big for seeking with home computer.

Even the topic name is misleading here - These are not PUZZLES ... there is no puzzle , no pattern , nothing. Just massive random numbers. With current hardware possibilities it could be solved but we need massive amonut of hardware to do it in a reasonable time.

It should be called something like "Computational Power Competition" or "Bitcoin Benchmark" not a "puzzle".

The only thing that can be solved by an average person are puzzles about maybe 90 - 100 bits but only in case the creator will reveal the public keys. But then solving puzzle 66 is a matter of few minutes and only competition is who will notice first that the public key is available ( and I doubt that was the goal of creator of all this thing).

When you realize with how big numbers we deal here and what is the speed of our machines the only solution is to give up.

Of course one would treat this as a lottery but considering the power consumption and ultra low chances to win  a (let's be honest) not that big reward (its significant amount but not a life changer) i doubt it's worth it...

Anyway it was useful experience from educational point of view.

Nice

Hello, I've been following this thread for a year. I stocked all of them, including many archives that were deleted from the internet, along with their source code.

I just came up with a new idea and I need a little help with it.

Do you have fast point extraction algorithm for python ?

Thanks..

Not: sorry for my bad english, i don't know english i use google translate

I'm writing an algorithm for all addresses with pubkey exposed. This is impossible with your method.

If you guys try to skip non-random keys (like those containing repeating patterns like 111) then you can also try to skip ranges when some prefixing characters of the address were found.
Example: You found a prefix 1XXXXX of target 1XXXXX... so you can skip ahead like nBits because it is unlikely 1XXXXX will appear in nBits again. The skipped offset nBits should be very conservative/pessimistic.

Or when doing it multithreaded you can mark nBits around the found prefix 1XXXXX as "unlikely" and continue the search only in the "possible" ranges. You could decrease the unlikely nBits as you progress to eventually realize this does not work too.

There's the math comes again,

66 Bit puzzle  


the total number of keys in this range can be calculated by taking 16 to the power of 17 (i.e., 16^17), which is equal to 295,147,905,179,352,825,856.

So, there are a total of 295,147,905,179,352,825,856 keys in the given range.

If you have a speed of 343 million keys per second (Mkeys/s), the result's,

Total number of keys = 295,147,905,179,352,825,856
Time = Total number of keys Speed

Substituting the values, we get:

Time = 295,147,905,179,352,825,856 343,000,000
Time = 859,488,566,568 seconds

Therefore, it would take approximately 859,488,566,568 seconds (or about 27,247 years) to generate all the possible keys in the given range at a speed of 343 million keys per second. This is a very long time and may not be practically feasible.

what if i have 5000 mkeys to scan those number of key ?
it would take approximately 59,029,581,036 seconds (or about 1,872 years) to generate all the possible keys in the given range at a speed of 5000 million keys per second, still lame haha  

---

and there's other scenario to win the ticket haha

For a 66-bit puzzle, the key range would be from 0 to 2^66 - 1, which is:

0 to 7,922,816,251,426,433

The number of keys in this range is:

2^66 = 73,786,976,294,838,206,464

At a scanning speed of 343 Mkey/s, the time it would take to scan this entire range would be:

Time = Number of Keys Keys per Second

Time = (2^66) 343000000 = 215625224 seconds
= 3593754 minutes
= 59896 hours
= 2495 days
≈ 6.84 years

So, it would take approximately 6.84 years to scan the entire key range of a 66-bit puzzle at the given scanning speed.

If we were to randomly hit the private key in the middle of the range, then we would only need to scan half of the key range, which is:

2^65 = 36,893,488,147,419,103,232

Using the same formula as above, the time it would take to scan half of the key range would be:

Time = (2^65) 343000000 = 107812612 seconds
= 1796877 minutes
= 29948 hours
= 1248 days
≈ 3.42 years

So, if we randomly hit the private key in the middle of the key range, it would take approximately 3.42 years to scan half of the key range at the given speed of 343 Mkey/s.


btw, my close friend is neat, he's building something on ASICs L3+ to give a proof to scan the puzzle for mean time haha.
let's see..

WOW!
Somebody (maybe the owner) increased the unsolved puzzles prizes again by x10 😱
Now the puzzle #66 prize is 6.6 BTC, #67 is 6.7 BTC... and so on .... puzzle # 160 prize is 16 BTC now
👍🏼🥳

Amazing! Now it's getting interesting again tryting to beat those puzzles. Thanks for the information and thanks to the puzzle creator who is among us

I use the library, how can I find out, I looked in the Process Hacker 2 application to see if the library is connected to a remote server, but there were so many descriptions that I couldn't find anything