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

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.

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

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.

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.

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!

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.

Do you read about the Dunning-Kruger effect ?

REFRESH YOUR PAGES I UPDATED A BIT OF WHAT I SAID

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



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.




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

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

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.

Change your setting to accept dm from newbie Im interested in your work and would like to help

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.

i think it's working

hi, this also works for higher prefix than that for example for   ?

About 1500 - 1800M per card

neither the uncompressed public key is valid nor the compressed one. Both pub keys are invalid and does not lie inside the curve

How many keys/s does the 4090 can do with vanitysearch or bitcrack?

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.

About the keys above, here are 2 private keys, one will open one of the above, I just changed the X on the original one it converted to it's mirror version.


If you have seen the start range, end range for bitcoin keys, the above is the middle range.😉

The strange public key which I'm sure has a solution to it, when I try to convert from compressed to uncompressed I get an error.