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

and if this is what #65 looks like there no way it was "added" into the page without it already being there but under a different address so its hidden or litterly not being there and it being a gap in the keys 

the key 000000000000000000000000000000000000000000000001a838b13505b26867 had to not be there which would leave a gap in its 0-9 a-f rotation and or it was there under a false address but then you can tell what private keys are still hidden by looking for the yellow symbol saying balance not found..........  amd i right or wrong here?
000000000000000000000000000000000000000000000001a838b13505b26864
000000000000000000000000000000000000000000000001a838b13505b26865
000000000000000000000000000000000000000000000001a838b13505b26866
000000000000000000000000000000000000000000000001a838b13505b26867 this is #65 key
000000000000000000000000000000000000000000000001a838b13505b26868
000000000000000000000000000000000000000000000001a838b13505b26869

---

lets take this into real life ill buy a tesla v100 or whatever you guys think has computing strength for these to run on kang but in return we run my program too id bet all winning youd find it with mine before brute forcing the whole 17 digit code or using kang to back track the edcsa curve



and at this point im questioning does a bunch of people who've been running the same shit for years and cant seem to crack it cant try something new? not to bust your all balls but its been what 8 years since the start and were still using same tools programs not looking outside the box ect.

---

but if im not wrong i know what your saying by their not stored ect that wasnt what i was saying again ur confused on what i mean pleae fully understand what i say before you put your opinion in. there's no possible way you can just toss that found key in not a way no chance if there is please feel free to explain.

---

also again idk if your scared to have someone hear your voice or what but id gladly explain over a discord call sharing my screen and you can tell me how im wrong.

---

there goes the moderator he deleted one of my chats wonder why am i onto something or not he didn't block me from chatting

[moderator's note: consecutive posts merged]

You mean hexadecimal?   At this point I don't know if you are just trolling or really you are the perfect example of the dunning kruger effect

that's not possible though how would that key be added into the page? if each page from1 - the last start at 2^1 bit to 2^256 bit in order going up in bits 0-9 a-f with no skipped letters or numbers ect it litterly lists every key possible in that range that why there almost infinite pages because of it. itd really be easier with me sharing my screen and showing you. i know what your both saying ive read what you sent Alberto but that answers none of my questions i asked  a few post ago i kept asking if i was wrong on everything ii stated.



like you saying that the website just adds it in how was the first page made then ? it liiterly starts at 0 and goes up bits using 0-9 a-f on the first page its self for the first few puzzle that are on it how were those put there ? if every key possible for that bit range was there how was it put there with no gap to fill ?

---

this is the start of page one the found keys could not have been added unless it wasnt there in the first place meaning it skipped its 0-9 a-f rotation its really not that difficult to see.
000000000000
000000000001
000000000002
000000000003
000000000004
000000000005
000000000006
000000000007
000000000008
000000000009
00000000000a
00000000000b
00000000000c
00000000000d
00000000000e
00000000000f
000000000010
000000000011
000000000012

it follows like this for every page leading to a solved puzzle that puzzles private key could not be add unless it was missing. meaning if puzzle #1 was just being cracked right now and you went to add it you couldnt because theres already a key with a corresponding address to it made

This site actively monitors the puzzle/challenge:

https://privatekeyfinder.io/bitcoin-puzzle/
When a key is found, they can easily mark it and it will appear on its appropriate page...when the page is clicked on.

Like I said, keep on looking for your gap or whatever, I hope you find them all. I really do.

I know how those sites work, and it is what I said.

The correlation is, if I have a site that generates/shows 100 keys/addresses per page, I know exactly which page a private key is on/where it will show. I do not know the address of the key unless I visit that page or do the priv key to pub address myself.

The correlation is how many keys per page is listed on a site, we will say 100. so if I am looking for private key ea21 (decimal 59937), I know it will be on page 599 (59937 / 100).

Nobody it is against you, everybody is trying to teaching you how it works... please read:

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

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.

---

    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]

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!

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 ?

---

yes your scanning litterly trillions of page data but are you not also trying trillions of key combos in brute force ?? 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 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]

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.

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.

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.

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