Author

Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 218. (Read 230658 times)

newbie
Activity: 21
Merit: 0
yes your scanning litterly trillions of page data but are you not also trying trillions of key combos in brute force Huh?? all im saying is that using brute force you guessing randomly a 17 digit code. my way your scanning a 17 digit code looking for the last letter error or skipped character in sequence. id say your odds at finding one random character and guessing the whole 17 digit code is ,much easier.


If you dont believe me just do what i said gto look everything up its all there except for non cracked keys every other page is in order no skipped lines eventually on some pages finding in the list the other puzzles that were solved. again theres no way possible those keys were added to that list with a gab being there litterly no possible way. even though they arent say what your saying is true. there is no data  base that holds all keys. then how is puzzle #65 found on page 509472955201070048 Huh there had to be a skip in the keys to fill the gap. if not you could just go use CTRL F search the entire webpage data base for a p2pkh address if you type 66 its nothing found if you type any cracked puzzles p2pkh itll go to that page. if someone wants to talk over discord and i can computer screen share for a group thatd be alot easier than typing it out my discord is Otw2f#9888
You really do not understand how those sites work.

We have tried explaining it to you.

The reason 65 is there, is because the site put it there.

If there are 1 million keys (keep it small); and each page contains 100 keys. And a puzzle/challenge key had a private key of 23212; then I know it's on page 232. I can then simply go there in my html file and update that page.

Every time you click on a page, the site uses your CPU to fill in that page via privkey, pubkey, rmd160, all the way to pubaddress.

It's all good. I wish you luck in your endeavor!
please explain more? like i said one the main site includes keys 2^1 bit all the way last page ending in a 2^256 with the last digit being 0-9 a-f ? am i wrong ? following that if 65 is added into that data file there had to be a gap to enter did it not ? as i said before if you read it correctly.   

this is a small fraction of the list that the page #65 was found on but if from page 1 the key start at 2^1 bit and goes up in range starting at 0-9 then a-f once reaching 0 again it goes up 1bit? am i wrong here ? no im not you can clearly see if you looked at the website. for puzzle #65 to be added in there it had to not be there in the first place am i right or wrong again? if its not there you could simply do what ive been saying find the skipped key and input it.
000000000000000000000000000000000000000000000001a838b13505b26864
000000000000000000000000000000000000000000000001a838b13505b26865
000000000000000000000000000000000000000000000001a838b13505b26866
000000000000000000000000000000000000000000000001a838b13505b26867 this is #65 key
000000000000000000000000000000000000000000000001a838b13505b26868
000000000000000000000000000000000000000000000001a838b13505b26869





000000000000000000000000000000000000000000000001a838b13505b26864

000000000000000000000000000000000000000000000001a838b13505b26865

000000000000000000000000000000000000000000000001a838b13505b26866

000000000000000000000000000000000000000000000001a838b13505b26867 #65s private key had to be missing right before it was cracked so we would take the key before take the ending character off and add the missing one which was 7.

000000000000000000000000000000000000000000000001a838b13505b26868

000000000000000000000000000000000000000000000001a838b13505b26869





https://privatekeyfinder.io/private-keys/bitcoin/

 that is the main website that im referring too you can see start to finish the last digit goes up by 0-9 a-f


https://hashkeys.club//

in between the // put the puzzle your looking for but same as this website goes up 0-9 a-f same shit 


https://privatekeys.pw/keys/bitcoin/1

same as this website same shit.


all im saying is if theres no gap which means the keys cant just randomly be added later on then i could use the p2pkh to find it using CTRL F search just like you can for any solved puzzle.



CTRL F searches the entire data base of the website for any word you type.


like i said before just go look man its not hard there no possible way to just toss in a private key when its found unless there's a gap. if there's a gap in the ending digit pattern  0-9 a-f you'd program a tool t6o search through a certain range and find such gap being talked about.



yes your scanning litterly trillions of page data but are you not also trying trillions of key combos in brute force Huh?? all im saying is that using brute force you guessing randomly a 17 digit code. my way your scanning a 17 digit code looking for the last letter error or skipped character in sequence. id say your odds at finding one random character and guessing the whole 17 digit code is ,much easier.


If you dont believe me just do what i said gto look everything up its all there except for non cracked keys every other page is in order no skipped lines eventually on some pages finding in the list the other puzzles that were solved. again theres no way possible those keys were added to that list with a gab being there litterly no possible way. even though they arent say what your saying is true. there is no data  base that holds all keys. then how is puzzle #65 found on page 509472955201070048 Huh there had to be a skip in the keys to fill the gap. if not you could just go use CTRL F search the entire webpage data base for a p2pkh address if you type 66 its nothing found if you type any cracked puzzles p2pkh itll go to that page. if someone wants to talk over discord and i can computer screen share for a group thatd be alot easier than typing it out my discord is Otw2f#9888
You really do not understand how those sites work.

We have tried explaining it to you.

The reason 65 is there, is because the site put it there.

If there are 1 million keys (keep it small); and each page contains 100 keys. And a puzzle/challenge key had a private key of 23212; then I know it's on page 232. I can then simply go there in my html file and update that page.

Every time you click on a page, the site uses your CPU to fill in that page via privkey, pubkey, rmd160, all the way to pubaddress.

It's all good. I wish you luck in your endeavor!
    WRONG

If there are 1 million keys (keep it small); and each page contains 100 keys. And a puzzle/challenge key had a private key of 23212; then I know it's on page 232. I can then simply go there in my html file and update that page.


go to the website i gave you using a known private key found and try and find the page number based off just using the private key its not possible theres no correlation in the key and page number

WP your smart and great at what you do if youd take 10 minutes to do a screen share ill share my screen only and show you what i mean.



you wouldn't brute force anything you'd be finding the skipped ending digit following the sequence of 0-9 a-f. meaning its almost like if you typed something wrong and your trying to find that red underlined word. im in 2 telegrams and a few other chats im done typing im holding a call of a few people later on discord to explain if anyone wants added be my guest. if not i wish you best of luck in your hunt.  my discord is Otw2f#9888



real strong community you guys got made here though only if you guys worked together and not against each other......

[moderator's note: consecutive posts merged]
full member
Activity: 1162
Merit: 237
Shooters Shoot...
yes your scanning litterly trillions of page data but are you not also trying trillions of key combos in brute force Huh?? all im saying is that using brute force you guessing randomly a 17 digit code. my way your scanning a 17 digit code looking for the last letter error or skipped character in sequence. id say your odds at finding one random character and guessing the whole 17 digit code is ,much easier.


If you dont believe me just do what i said gto look everything up its all there except for non cracked keys every other page is in order no skipped lines eventually on some pages finding in the list the other puzzles that were solved. again theres no way possible those keys were added to that list with a gab being there litterly no possible way. even though they arent say what your saying is true. there is no data  base that holds all keys. then how is puzzle #65 found on page 509472955201070048 Huh there had to be a skip in the keys to fill the gap. if not you could just go use CTRL F search the entire webpage data base for a p2pkh address if you type 66 its nothing found if you type any cracked puzzles p2pkh itll go to that page. if someone wants to talk over discord and i can computer screen share for a group thatd be alot easier than typing it out my discord is Otw2f#9888
You really do not understand how those sites work.

We have tried explaining it to you.

The reason 65 is there, is because the site put it there.

If there are 1 million keys (keep it small); and each page contains 100 keys. And a puzzle/challenge key had a private key of 23212; then I know it's on page 232. I can then simply go there in my html file and update that page.

Every time you click on a page, the site uses your CPU to fill in that page via privkey, pubkey, rmd160, all the way to pubaddress.

It's all good. I wish you luck in your endeavor!
newbie
Activity: 21
Merit: 0
What Albert is saying; the keys aren’t ‘stored’ in some list on that website or any other website like it.

When a user clicks on a page, the website uses your cpu power to generate, the whole Bitcoin priv key to public address, at that time, on the fly.

Think about it, there isn’t enough memory/hard drive in the world to hold 2^256 keys, pub address, etc.

Using that site is pure brute forcing, page by page, which is eleventy million billion times slower than current programs.


i think your confuesed on what i mean yes 100% their stored it litterly tells you all private keys directory. but in all their skipped please go back and read what i said. if key #65 is in the puzzle on page 509472955201070048 theres no possible way that key was added to the list of private keys with there being a gap to fill meaning on page
 509472955201070048 before puzzle #65  was found the order of private keys on the page went see how the ending numnber doesnt go in order by 0-9 a-f it skipped a key knowing that id copy and paste the before key and change the last character to its right key this being the number 67.

000000000000000000000000000000000000000000000001a838b13505b26864
000000000000000000000000000000000000000000000001a838b13505b26865
000000000000000000000000000000000000000000000001a838b13505b26866
000000000000000000000000000000000000000000000001a838b13505b26868
000000000000000000000000000000000000000000000001a838b13505b26869

this is what the list looks like when #65 puzzle was added there is no way possible that you could have put 65 on that page unless the key was missing.
000000000000000000000000000000000000000000000001a838b13505b26864
000000000000000000000000000000000000000000000001a838b13505b26865
000000000000000000000000000000000000000000000001a838b13505b26866
000000000000000000000000000000000000000000000001a838b13505b26867
000000000000000000000000000000000000000000000001a838b13505b26868
000000000000000000000000000000000000000000000001a838b13505b26869

 knowing this info the main website and the one i found have in order from 0-9 a-f increasing in 1 bit when finishing its rotation on 0-9 a-f . there no nothing their litterly in order the ending number of the private key start at 0 going 1-2-3-4-5-6-7-8-9-a-b-c-d-e-f-0-1-2 ect on one of these pages there HAS TO BE a skip in the pattern if not id be able to hold "CTRL F' search the p2pkh address and find what page 66 private key is on. test it yourself go to all private keys and btc. hold CTRL AND F type in a found puzzles p2pkh and itll take you to it type in a non found puzzle and its not in the data of the website



easier way to explain it say you have the following numbers. you cant just add a "new" 7 its already there on one page it goes 1,2,3,4,5,6,8,9,10
1
2
3
4
5
6
7
8
9
10

 you guys also dont think that your computer couldnt find a missing 1 digit character in a sequence of numbers and letter that don't change  rather than finding the missing 17 by its self HuhHuhHuhHuhHuhHuh?



yes your scanning litterly trillions of page data but are you not also trying trillions of key combos in brute force Huh?? all im saying is that using brute force you guessing randomly a 17 digit code. my way your scanning a 17 digit code looking for the last letter error or skipped character in sequence. id say your odds at finding one random character and guessing the whole 17 digit code is ,much easier.


If you dont believe me just do what i said gto look everything up its all there except for non cracked keys every other page is in order no skipped lines eventually on some pages finding in the list the other puzzles that were solved. again theres no way possible those keys were added to that list with a gab being there litterly no possible way. even though they arent say what your saying is true. there is no data  base that holds all keys. then how is puzzle #65 found on page 509472955201070048 Huh there had to be a skip in the keys to fill the gap. if not you could just go use CTRL F search the entire webpage data base for a p2pkh address if you type 66 its nothing found if you type any cracked puzzles p2pkh itll go to that page. if someone wants to talk over discord and i can computer screen share for a group thatd be alot easier than typing it out my discord is Otw2f#9888



if thats not the case the someone explain how all other puzzles that were found were just randomly added to the data sheet of keys ? itd be impossible unless its the first or last key on the page which it is because again you cant take and add a 7 into it youd have to have a gap to fill either a missing 7 and or the key found would be at the start or end of every page because that the only place one can add to without breaking the chain of 0-9 a-f as in i could only add 0 or 11 to my list i couldn't just toss that ending 7 in there with one already there btc private keys cannot be switched to different addresses.
0
1
2
3
4
5
6
7
8
9
10
11

[moderator's note: consecutive posts merged]
full member
Activity: 1162
Merit: 237
Shooters Shoot...
What Albert is saying; the keys aren’t ‘stored’ in some list on that website or any other website like it.

When a user clicks on a page, the website uses your cpu power to generate, the whole Bitcoin priv key to public address, at that time, on the fly.

Think about it, there isn’t enough memory/hard drive in the world to hold 2^256 keys, pub address, etc.

Using that site is pure brute forcing, page by page, which is eleventy million billion times slower than current programs.

newbie
Activity: 21
Merit: 0
could you re word that first part please i may be reading it wrong i apologize.

alberto is trying to tell you: Why the web page is not getting the privet keys themself? Because they have the same limitations than us.

I hope that helps understand what alberto is trying to tell you.

Cheers.
[/quote] id see that as a setting point but also who knows who runs them  iis it the creator or a random?  have they thought about this? because as of now no one has tried patterns or anything with the website other than to get info to use on kang/or a brute force tool. as of todays time stamp everyone has stated that there is no pattern that its just a brute force or a innovative way of  thinking could solve it. maybe the clues he leaves are right in front of us but were all looking to deep.
hero member
Activity: 583
Merit: 502
could you re word that first part please i may be reading it wrong i apologize.
[/quote]

alberto is trying to tell you: Why the web page is not getting the privet keys themself? Because they have the same limitations than us.

I hope that helps understand what alberto is trying to tell you.

Cheers.
newbie
Activity: 29
Merit: 0
How does V100 perform btw? I'm asking cause nterested what kind of specs are preferable when using BSGS or kang. Teslas got high speed and a decent amount of HBM vram but less cuda cores compared to consumer grade cards. But V100 is about 5 years old which is a lot.
newbie
Activity: 21
Merit: 0
i also feared of posting it because like you said im very confident this will work with the right people. but the chances of those people actually putting me into their group and let inn is highly unlikely. if someone did crack it with what ive put out in  todays world there would be no split I'd be happy with 10% and knowing i helped to be honest. but a %60 to the coder and %40 to me seems to bee reasonable. also this cut % would drop per person added to the group as in why i probably wouldn't be let in on anything. i can work normal things i cant just fully code a entire program myself im not that far into yet. but if someone made it then told me how to run it after first attempt id be able to run the 2 computers i have 24/7 till they burnt out. with the possibility if someone does bring me in id go buy a few more computers or a teslav100
newbie
Activity: 21
Merit: 0
ive also been asked how i know theres a missing key, if all found/cracked puzzles are on there. there had to be a gap to fill to put it there you cant randomly make one, knowing that they would be  at the beginning or end if it was that was the case. i could take the first key and the last and go back on character. meaning if it ends with a 5 id copy and paste they private key delete the 5 and type a 4. but its not that easy. also if your on windows and hold " CTRL AND F" you can search a website for its entire data base. if you search any found/cracked key it goes to its page if you type a none found puzzle it says 0/0 found.
newbie
Activity: 21
Merit: 0
i just read it i don't quite understand what your getting please go further in detail. not to be rude.

well, you seem very confident and optimistic about what are you saying, and that is good actually we need people with good optimistic.

If you dependent of the reply of some website then what avoid to the website to found a puzzle?

What I am tryting to tell you is that this kind of programs need to generate the keys on the fly without depend of anything else. I recomend to you to read the informacion about how keys are generated.

https://www.oreilly.com/library/view/mastering-bitcoin/9781491902639/ch04.html

Also wha are you saing to store that data? that is complety unnecesary, the keys need to be generated and checked on the fly without store anything.

Best regards!
could you re word that first part please i may be reading it wrong i apologize. I can't code and wouldn't know how to do it on the fly. What i mean is over all pages that lay in the key range of #66 is around 100 TB or more of data. Youd 1 either need to generate a program that pulls from the website its self and does it on the "fly" like you said. but then your also accounting for website connection to your program ect the data that those public keys hold and the data that the full private key holds.....   takes up alot more time to scan through everything unless you can code it good enough i wouldn't know i cant code.  in my head you cant just run a program straight from the websites data so. in my head i thought the fastest way would to be is take batches of data through the program you make. obviously batches unless you have a hard drive for over 100TB of data.  



trying not to be confusing but i just didn't know you could run the program straight from the website like that. it would indeed speed the process. in my head since i didn't know that id have to pull such data into a .txt file and run the program off that. and then since its 100TB at least of data id have to delete the keys i went through and grab another .txt of the next batch of keys/pages.
hero member
Activity: 862
Merit: 662
i just read it i don't quite understand what your getting please go further in detail. not to be rude.

well, you seem very confident and optimistic about what are you saying, and that is good actually we need people with good optimistic.

If you dependent of the reply of some website then what avoid to the website to found a puzzle?

What I am tryting to tell you is that this kind of programs need to generate the keys on the fly without depend of anything else. I recomend to you to read the informacion about how keys are generated.

https://www.oreilly.com/library/view/mastering-bitcoin/9781491902639/ch04.html

Also wha are you saing to store that data? that is complety unnecesary, the keys need to be generated and checked on the fly without store anything.

Best regards!
newbie
Activity: 21
Merit: 0
Do you read about the Dunning-Kruger effect ?
i just read it i don't quite understand what your getting please go further in detail.  not to be rude.      I also forgot to put that i know its TB's of data probably 100 ish i my self have a 8tb hard drive that's why i said it'd take a team of at least 3 you then could go buy 10 TB-30TB hard drives for 1-300$ i also forgot to add all found puzzles are also on those pages in their right spot somewhere in that list is missing spots for those other puzzles.
hero member
Activity: 862
Merit: 662
Do you read about the Dunning-Kruger effect ?
newbie
Activity: 21
Merit: 0
REFRESH YOUR PAGES I UPDATED A BIT OF WHAT I SAID
newbie
Activity: 21
Merit: 0
everyone is pming about the message i deleted im gonna repost it  with less explaining if you understand and want to help be my guest....  IM IN NEED OF A CODER

YES I UNDEERSTAND THESE ARE STILL MASSIVE RANGES BUT ITS MORE LOGICAL THAT YOU WOULD FIND IT THIS WAY BEFORE BRUTE FORCE. also with other people having estimated the ranges they think its in they could find those ranges on the pages and run those only. still lookking for a skipped key.


taking this website or the main one https://hashkeys.club/66/ you get a list of all know private keys. from page 1 till the ending each key goes up by a-f 0-9
all know keys including the puzzles weve found are on these pages not one page skips a-f 0-9.

we would need a team to pull data from that website in between #66s start and stop key. you then make a program to go and check for the skipped key. if your confused at this point scroll down and look at the explanation.


this would be faster than brute force or kangaroo if the right coder sees this. making it faster and optimizing computation power wouldn't be hard it'd be mainly in the code. one program could take the 1st 15 characters from the key and the public key and delete them because neither matter were looking for the skipped pattern in keys here.

youd then have 3 character keys ending in 0-9 a-f one would be skipped once you found the skipped one you could then take they previous or after key in that row copy and paste it and change the last character to its correct one.


now knowing that say we start on page 1 of #66s key range one person would take pages 1-10,000,000,000 and the next would take data from pages 10,000,000,001-ect and so one once finishing your range moving to the next every time you switch/finish a range Youd save it in a txt document saying what ranges you covered. one 66 is found by then the code would be perfected im guessing we could then go on to use the same thing to find the rest.

MY PM IS OPEN TO ANYONE NEW OR OLD ACCOUNT DONT BE SCARED, SCARED MONEY IS NO MONEY, EVERY OPINION SHOULD BE TAKING WITH SERIOUS PERCATIONS



this is how the keys are ordered.... this is also the start range page for #66 so page 1 for 66 obviously 66 wont have 13 conscecutive 0s we could cancle out around 5 billion pages  just off start. now if a few of you smarter people looked at it and did some math we could cancel out alot more unneeded data


Code:
20000000000000000 1LgpDjsqkxF9cTkz3UYSbdTJuvbZ45PKvx
20000000000000001 1KZegRZVRkVPUcR6iCZWukdeeP6xuEwpo9
20000000000000002 1BDYfXvbbuiBA4NqGvZcnEN34eP2ustpUg
20000000000000003 1EStercxjVWvs1J6JR7SZmg6ppWhUsRBjG
20000000000000004 1JbM6Yokeh87L8MKtqpMnLJMFGGwSKGBqG
20000000000000005 1P9kfLQ571tLPEHkJALCEh5h3QnvvDWCTc
20000000000000006 1DkRiFNSh5Q5om2xgcHVJKdy5FtJSSNiij
20000000000000007 1CobHRBy8BGJj5EpAh12nLLxYZxq1oDVkj
20000000000000008 17RZDVYFCBhvxfwCdt5gcKuZ4dbY6xedxV
20000000000000009 1F63aSVVNh6N9oppEYCKLbDb4SrUQ46rQr
2000000000000000a 13KaxDKfH1QqCyujpsAELdrcFXm4JiyizE
2000000000000000b 1MWL4T6S7rBtym9yW5iuA58KGC2dJyeG56
2000000000000000c 1CnGkJNUQGQ5xCWzHH5gMtfwrETGkhRNF7
2000000000000000d 1913QZXUZ2PCZgpjTW9KE6hUCRTLqK6yQC
2000000000000000e 1FUEXcfFy42cEQkAF7SXNZ5fdK9fAp1fua
2000000000000000f 15uYS3Qg8W8JfqDoXkP7yKB6XRQ3fMGUnN
20000000000000010 1438EHe9FJqc2GmHxBbznC9pCQ613kihHK
20000000000000011 1MUrXZ88kSfGGCd8cSTqGVutHkyp33ZKz4
20000000000000012 1HmQsyFcYxWKExNRtFg9jRHeaVRVPxit5x
20000000000000013 1LFGyR56MqBsSr87tHtn7BLaWf1rnnrYKZ
20000000000000014 1GER1T8g5U7AJPxbnQWSBCL7W8C3eCtPo8
20000000000000015 13dQuf7c2bEQweUThzsgMNmG1mQRGXvPX8
20000000000000016 1NafC6QuMjHBe91U8bGKJE5vhp9o3TsWbo
20000000000000017 17hgBS2SfjpPpE78TLk8T4CFJPFkCvcNnY
20000000000000018 19Kg8XA1HKkS3Myb8gBjcAt1tng75zAi2s
20000000000000019 1BGxbY8eHj879DUggRETCyKkU2Kkk5wHAb
2000000000000001a 1GEFZAgMjJvKasNnc7vEr8pZBLNYHgQrne
2000000000000001b 13HaX3ExLTRyd5QdemwYUj4w6jDAcz7ezd
2000000000000001c 14yXTwMoSwNPfS3Y8vo1mrcWb3fcqeASBg
2000000000000001d 1JUtUH3yTi2Ewn6z6WAFZFHmSpn2mdP9tZ
2000000000000001e 16eAUPhzrVnSw11P9mrPGNNsaStZPJoMtF
2000000000000001f 13ir12Md1ps6kNNPzdgRoJ8GjhsBceF899
20000000000000020 15ja996vUJxrxSMVCCDdr8A72FVndg6ePN
20000000000000021 13SbSitb1bqi8gkqt17C4Xci8n9YATgZLT
20000000000000022 1GRr4tW37cfjDPq4WKnhYoZKKeQuQeZT9P
20000000000000023 1NwxmS2NWybGApiJkSHiE3XsrM1JpUvoK8
20000000000000024 19MhQoK1dogwwGbUSgMUshHkprts8f9mpm
20000000000000025 1ACKwm5XFqC3PuxNaCrqRovS44Tgc3ANrf
20000000000000026 15sBKLE186A1MXzNyu1o7R4kGu6a3NsPnU
20000000000000027 13XfEzGZTSH3unYidJJf3x7tqLsA8Jm7fe
20000000000000028 1CCLMkY1ZRnqEmTYrroKf4BjZ74rqtTwWg
20000000000000029 15R7s5uCn29knKvK6pcYY5eXkMZZpvdNTF
2000000000000002a 1DpFfvorvxGmkAvHqwLn8gAAsDaP5AjUf2
2000000000000002b 1CjU7ipAhiRXRLidVwW9nJDb7y4MPTyGhW
2000000000000002c 16eJdFtYuAD8XqBm1JdRs5jwhWmwGWdMre
2000000000000002d 1ARXYSTdM5yYBTx9mLnpS8Kac2Aj1GkPfH
2000000000000002e 18BjCfFN1QdxcekJGUHeCozVYoSwvp7GoC
2000000000000002f 15rdrhf1v6oDHM6HsLch19HE7jyJkPVvxq
20000000000000030 114rFJxX2PjF4KJfnR8MgNsjecTGWh1FPz
20000000000000031 176wQ88R7UHofhoSU4P2MdGZT8SR3Y1Aq3
20000000000000032 15x83iHKNQxPmeFupxSZWQhtsgo6gsdLPk
20000000000000033 16gWTMdfB8XPqMMskRwmBR6gwKZheFw9Vc
20000000000000034 1taQK1vTnrTfpyUtLhAuB68r4cEPmF8m7
20000000000000035 1GsaodHkr2ZX3Vaj9yzQfJRynt4iLf31mB
20000000000000036 1G7rgdm68T5hTmhUoZM3m48bGACRQXTgh5
20000000000000037 19HgWkLBQvyygjGSEKNQNdBt7AnBeFcX6W
20000000000000038 1Q4XYQ9EQ9CmdGX19j86oPaBJWiWUKxXYi
20000000000000039 1MjkRPzrMFhbFCZGfZd61Zn3KMQTETnb6G

this is how a page would look if it had the private key of the puzzle your looking for. see how the 3rd on that should end in 3 is mising that would be 66 youd then cop the before key or after one and delete the ending number and add the one that was skipped.

Code:
20000000000000000 1LgpDjsqkxF9cTkz3UYSbdTJuvbZ45PKvx
20000000000000001 1KZegRZVRkVPUcR6iCZWukdeeP6xuEwpo9
20000000000000002 1BDYfXvbbuiBA4NqGvZcnEN34eP2ustpUg
20000000000000004 1JbM6Yokeh87L8MKtqpMnLJMFGGwSKGBqG
20000000000000005 1P9kfLQ571tLPEHkJALCEh5h3QnvvDWCTc
20000000000000006 1DkRiFNSh5Q5om2xgcHVJKdy5FtJSSNiij
20000000000000007 1CobHRBy8BGJj5EpAh12nLLxYZxq1oDVkj
20000000000000008 17RZDVYFCBhvxfwCdt5gcKuZ4dbY6xedxV
20000000000000009 1F63aSVVNh6N9oppEYCKLbDb4SrUQ46rQr
2000000000000000a 13KaxDKfH1QqCyujpsAELdrcFXm4JiyizE
2000000000000000b 1MWL4T6S7rBtym9yW5iuA58KGC2dJyeG56
2000000000000000c 1CnGkJNUQGQ5xCWzHH5gMtfwrETGkhRNF7
2000000000000000d 1913QZXUZ2PCZgpjTW9KE6hUCRTLqK6yQC
2000000000000000e 1FUEXcfFy42cEQkAF7SXNZ5fdK9fAp1fua
2000000000000000f 15uYS3Qg8W8JfqDoXkP7yKB6XRQ3fMGUnN
20000000000000010 1438EHe9FJqc2GmHxBbznC9pCQ613kihHK
20000000000000011 1MUrXZ88kSfGGCd8cSTqGVutHkyp33ZKz4
20000000000000012 1HmQsyFcYxWKExNRtFg9jRHeaVRVPxit5x
20000000000000013 1LFGyR56MqBsSr87tHtn7BLaWf1rnnrYKZ
20000000000000014 1GER1T8g5U7AJPxbnQWSBCL7W8C3eCtPo8
20000000000000015 13dQuf7c2bEQweUThzsgMNmG1mQRGXvPX8
20000000000000016 1NafC6QuMjHBe91U8bGKJE5vhp9o3TsWbo
20000000000000017 17hgBS2SfjpPpE78TLk8T4CFJPFkCvcNnY
20000000000000018 19Kg8XA1HKkS3Myb8gBjcAt1tng75zAi2s
20000000000000019 1BGxbY8eHj879DUggRETCyKkU2Kkk5wHAb
2000000000000001a 1GEFZAgMjJvKasNnc7vEr8pZBLNYHgQrne
2000000000000001b 13HaX3ExLTRyd5QdemwYUj4w6jDAcz7ezd
2000000000000001c 14yXTwMoSwNPfS3Y8vo1mrcWb3fcqeASBg
2000000000000001d 1JUtUH3yTi2Ewn6z6WAFZFHmSpn2mdP9tZ
2000000000000001e 16eAUPhzrVnSw11P9mrPGNNsaStZPJoMtF
2000000000000001f 13ir12Md1ps6kNNPzdgRoJ8GjhsBceF899
20000000000000020 15ja996vUJxrxSMVCCDdr8A72FVndg6ePN
20000000000000021 13SbSitb1bqi8gkqt17C4Xci8n9YATgZLT
20000000000000022 1GRr4tW37cfjDPq4WKnhYoZKKeQuQeZT9P
20000000000000023 1NwxmS2NWybGApiJkSHiE3XsrM1JpUvoK8
20000000000000024 19MhQoK1dogwwGbUSgMUshHkprts8f9mpm
20000000000000025 1ACKwm5XFqC3PuxNaCrqRovS44Tgc3ANrf
20000000000000026 15sBKLE186A1MXzNyu1o7R4kGu6a3NsPnU
20000000000000027 13XfEzGZTSH3unYidJJf3x7tqLsA8Jm7fe
20000000000000028 1CCLMkY1ZRnqEmTYrroKf4BjZ74rqtTwWg
20000000000000029 15R7s5uCn29knKvK6pcYY5eXkMZZpvdNTF
2000000000000002a 1DpFfvorvxGmkAvHqwLn8gAAsDaP5AjUf2
2000000000000002b 1CjU7ipAhiRXRLidVwW9nJDb7y4MPTyGhW
2000000000000002c 16eJdFtYuAD8XqBm1JdRs5jwhWmwGWdMre
2000000000000002d 1ARXYSTdM5yYBTx9mLnpS8Kac2Aj1GkPfH
2000000000000002e 18BjCfFN1QdxcekJGUHeCozVYoSwvp7GoC
2000000000000002f 15rdrhf1v6oDHM6HsLch19HE7jyJkPVvxq
20000000000000030 114rFJxX2PjF4KJfnR8MgNsjecTGWh1FPz
20000000000000031 176wQ88R7UHofhoSU4P2MdGZT8SR3Y1Aq3
20000000000000032 15x83iHKNQxPmeFupxSZWQhtsgo6gsdLPk
20000000000000033 16gWTMdfB8XPqMMskRwmBR6gwKZheFw9Vc
20000000000000034 1taQK1vTnrTfpyUtLhAuB68r4cEPmF8m7
20000000000000035 1GsaodHkr2ZX3Vaj9yzQfJRynt4iLf31mB
20000000000000036 1G7rgdm68T5hTmhUoZM3m48bGACRQXTgh5
20000000000000037 19HgWkLBQvyygjGSEKNQNdBt7AnBeFcX6W
20000000000000038 1Q4XYQ9EQ9CmdGX19j86oPaBJWiWUKxXYi
20000000000000039 1MjkRPzrMFhbFCZGfZd61Zn3KMQTETnb6G



i asked chat gpt to scan through 1000 keys this is how she found it if any one is confused on what im saying still. this is what CHATGPT got

My apologies for the mistake. Using the correct pattern (each key is changed by 1 bit going up starting with 0-9 and then A-F, and then restarting at 0 after reaching F), we can find the missing key.

The missing key between 2fd6860a09cb543fc and 2fd6860a09cb543fd should have a value of 2fd6860a09cb543fb.                   2fd6860a09cb543fb. was the one i deleted out of the 1000 key's i gave her. obviously the code would have to prioritise speed but. just basic knowledge tells me this is the easiest way. youd find the missing key before you guessed the entire 17 digit code
jr. member
Activity: 56
Merit: 1
why was the last post of "Professor of wilds" here about puzzle #66 deleted? To the poster: please write again your proposal about the key search and the list you posted
i deleted it because i realized that no one would probably help me if you want to know what i said i have a high chance with the right people we could solve the next keys without kang or brute. if you can code send me your discord telegram anything if you want to try and help. its brought a lot of attention that i deleted my post but never got any while up? maybe that's why i took it down scared for someone to take what i know.



Code:
import requests
from bs4 import BeautifulSoup
from multiprocessing import Pool
from tqdm import tqdm

def check_website(page_number):
    url = 'https://hashkeys.club/66/?page='
    search_text = '13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so'

    # İstek gönder
    response = requests.get(url + str(page_number))
    soup = BeautifulSoup(response.content, 'html.parser')

    # Aranacak etiketi belirle
    search_tag = soup.find('keys')

    # Aranacak kelimeyi içeren metni kontrol et
    if search_tag and search_text in search_tag.get_text():
        return page_number
   
    return None

if __name__ == '__main__':
    # İşlem havuzu oluştur
    cekirdek=10
    with Pool(processes=cekirdek) as pool:
        # Sayfa numaraları
        page_numbers = range(79000000000001, 36893488147419104)

        # İşlem havuzundaki işlemleri başlat
        results = []
        with tqdm(total=len(page_numbers)) as pbar:
            for result in pool.imap_unordered(check_website, page_numbers):
                if result:
                    results.append(result)
                pbar.update(1)

        # Sonuçları göster
        if results:
            print('Aranacak kelime bulundu sayfa numaraları: ', results)
        else:
            print('Aranacak kelime bulunamadı.')
member
Activity: 185
Merit: 15
Two things you should never abandon: Family & BTC

fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364140 .. there are also invalid public keys. The reason is  there are pub keys that lie outside the curve. But i gotta agree that the mentioned pubs above are interesting, especially knowing that one of their addresses is a used one.
There is no such a thing as invalid private or public key, whatever private key you think is invalid or outside the range, I will prove you wrong if you just show it to me.

Deal! Prove me wrong, type this pvt key into the "view details" page in bitaddress.org and if you get an address out of it I'll send you 5 BTC:

fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364142
member
Activity: 194
Merit: 14
i deleted it because i realized that no one would probably help me if you want to know what i said i have a high chance with the right people we could solve the next keys without kang or brute. if you can code send me your discord telegram anything if you want to try and help. its brought a lot of attention that i deleted my post but never got any while up? maybe that's why i took it down scared for someone to take what i know.

Can you re - post what you previously said? I didn't see it earlier. Maybe if you have a good idea about puzzle 66 we can then "try" to bruteforce it together.
jr. member
Activity: 32
Merit: 1
why was the last post of "Professor of wilds" here about puzzle #66 deleted? To the poster: please write again your proposal about the key search and the list you posted
i deleted it because i realized that no one would probably help me if you want to know what i said i have a high chance with the right people we could solve the next keys without kang or brute.

Change your setting to accept dm from newbie Im interested in your work and would like to help
newbie
Activity: 21
Merit: 0
why was the last post of "Professor of wilds" here about puzzle #66 deleted? To the poster: please write again your proposal about the key search and the list you posted
i deleted it because i realized that no one would probably help me if you want to know what i said i have a high chance with the right people we could solve the next keys without kang or brute. if you can code send me your discord telegram anything if you want to try and help. its brought a lot of attention that i deleted my post but never got any while up? maybe that's why i took it down scared for someone to take what i know.
Jump to: