new tool for cracking the puzzle 67

[dibzzy]

hey guys im new , i created this little script about a year ago, i've been using it on and off to search trough puzzle 66 keys range but with no luck . now i use it for 67 and i decided today to share it with you

its an easy CPU script that scans trough a range of private keys in (DEC) format. Its good for slower machines and i use it in the background while doing other stuff on pc.
my ryzen 5 5600x can scan trough about 40-50.000 keys / s

to use it you just need to:
- edit the desired wallet you are looking for
- edit the range trough which the script should look [in decimals]

for example for puzzle 67 the range is hex= 40000000000000000:7ffffffffffffffff
that in decimals is 73786976294838206464:147573952589676412927

this script scans trough decimals you select and when it finds the corresponding wallet , it saves the info to a txt file

its easy to use and its my first tool , i've been known about btc since 2018 i was only 11 years old and my parents never touched crypto

if you like it please consider supporting me and hope i can create better tools soon

here's a link https://github.com/dibzzy/Easy-Bitcoin-puzzle-key-scanner

thank you all and hope you find this helpfull

[cctv5go]

Too slow, thank you. Good luck to you 😊

[The Long Run]

Hello, also new here: Is puzzle 67 related to "Bitcoin puzzle transaction ~32 BTC prize to who solves it"
https://bitcointalk.org/index.php?topic=1306983.0;topicseen

[ronin445]

Considering the speed
better use another program
 with that speed you should be very veeeeeeeery lucky to find something.

[jovica888]

I am running Rotor Cuda on my second PC with an old Zotac Nvidia 1060 GTX and I am getting about 150.000.000 keys per seconds...

I am learning Python and try to also to make my way for scan private/public keys...

I think the fastest way to generate public keys with CPU is to use ice library

https://github.com/iceland2k14/secp256k1

you can use ice.point_sequential_increment(3500000, P)
So you have point P and in 2 seconds I get 3.5 million of next points (+G+G+G+G+G+G....) and then you can proceed with that array... That is the faster way than checking one by one
And when you are finished with 3.5 million of points then last point from that batch will be the next point P and then again ice.point_sequential_increment(3500000, P)

Keep experimenting... that is the only way to success

[kTimesG]

I think the fastest way to generate public keys with CPU is to use ice library

So you have point P and in 2 seconds I get 3.5 million of next points

That's a terrible speed to get points of sequential keys, on a CPU. A good implementation can reach at least 20 million pubKeys / second, on a single thread, on a modest CPU.

[dibzzy]

I think the fastest way to generate public keys with CPU is to use ice library

So you have point P and in 2 seconds I get 3.5 million of next points

That's a terrible speed to get points of sequential keys, on a CPU. A good implementation can reach at least 20 million pubKeys / second, on a single thread, on a modest CPU.

thx for the feedback , yes i used this in the past but i upgraded my gpu recently and now im using some version of vanity search and im doing about 500mk/keys ... this cpu tool i made is for slower/older laptops .. its not that bad imo since its my first code .. good luck everyone finding puzzle 67

[Kelvin555]

AlbertoBSD's keyhunt program runs at 10mk/s on my laptop, so why use this ?

I suggest you should use his program if you are searching by CPU.