Bitcoin puzzle transaction ~32 BTC prize to who solves it

[Evillo]

Lol you don't get it yet do ya? I can use a kiddy python script to create an address like the one above using an invalid pvt key.. but you know what that means? It means that i have an address that i will never be able to use.. why? Because I DO NOT KNOW THE PVT KEY THAT WILL ACTUALLY SPEND FROM IT. the out-of-range pvt key i posted happens to hash its way to that address, but it's not able to spend from it. Get it? The word "invalid" is not an accessory. It literally means you're screwed if you use it

Would you like to put your money on it? Go ahead and send a few bucks to it, and watch how I spend from it. You don't get it yet do ya? !!!

Come on now😉

Not so fond of sending stuff to a dead address .. Why not you do in and out txs from it right now and be my hero?

Edit:

https://www.reddit.com/r/Bitcoin/comments/2ypgyd/how_does_the_range_of_valid_ecdsa_private_keys/?utm_source=share&utm_medium=android_app&utm_name=androidcss&utm_term=1&utm_content=share_button

Reading the above post, it proves that generating from out of range keys will let it roll over again, meaning you still didn't get out of the pvt key range. You and me were wrong lol. I was wrong when i implied we could hash our way to the address using such pvt key. You were wrong when you thought the key is valid.

[kalos15btc]

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 ?


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]

Did you understand now? its a script
see here

https://github.com/TheZ3ro/bitcoin-privatekey-db/blob/master/server.py

there is no pages,, its generated by you own computer the page that you click and random choosen ad the user explained to you, so dont waste your time here explaining to us 10 times your idea,

[Evillo]

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 ?


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]

Did you understand now? its a script
see here

https://github.com/TheZ3ro/bitcoin-privatekey-db/blob/master/server.py

there is no pages,, its generated by you own computer the page that you click and random choosen ad the user explained to you, so dont waste your time here explaining to us 10 times your idea,

Google, Microsoft, IBM, Oracle and all other big names combined can't hold the amount of data that the pvt key space consists of. If this doesn't convince him, I don't know what else to say.

Edit: wait, actually that was a naiive example. Here's another one: the total amount of pvt keys equal - give or take - the amount of atoms in the entire universe.

Imagine having the delusion to believe a website can hold this much data 😂

[lordfrs]

What is the fastest way to search multiple pubkeys? bsgs or kangaroo?? How many pubkeys can I search at one time?

[Evillo]

What is the fastest way to search multiple pubkeys? bsgs or kangaroo?? How many pubkeys can I search at one time?

Tried up to 160,000 pubs on keyhunt BSGS before.

[WanderingPhilospher]

What is the fastest way to search multiple pubkeys? bsgs or kangaroo?? How many pubkeys can I search at one time?

It really depends on what your plan of attack is.
Sometimes it’s kangaroo, sometimes it’s BSGS and believe it or not, sometimes it’s brute force.

[zahid888]

The amount of space that 2^67 lines of text would take up in a .txt file depends on the length of each line.
line: 20000000000000000(17 char) 1LgpDjsqkxF9cTkz3UYSbdTJuvbZ45PKvx (34 char) 17+34 = 51
total number of characters as follows:
2^67 lines * 51 characters per line = 3,689,348,814,741,248 characters
Each character takes up 1 byte of storage in a .txt file, so we can convert the total number of characters to bytes as follows:
3,689,348,814,741,248 bytes = 3,689,348,814,741 kilobytes (KB)
3,689,348,814,741 KB = 3,600,116,533 megabytes (MB)
3,600,116,533 MB = 3,515,203 terabytes (TB)
Therefore, if each line contains 51 characters, 2^67 lines of text would take up approximately 3,515,203 terabytes of space in a .txt file.
As of 2021, it is estimated that Google has over 2.5 million servers located in data centers around the world, with a total storage capacity of around 10 exabytes (10,000,000 terabytes) or more.
So, let us persuade Google to allocate 35% of its storage space to accommodate the data for our website.
The worst discussion I have seen in the entire thread till date is in these 2 to 3 pages.

[ProjectSe7en]

The amount of space that 2^67 lines of text would take up in a .txt file depends on the length of each line.
line: 20000000000000000(17 char) 1LgpDjsqkxF9cTkz3UYSbdTJuvbZ45PKvx (34 char) 17+34 = 51
total number of characters as follows:
2^67 lines * 51 characters per line = 3,689,348,814,741,248 characters
Each character takes up 1 byte of storage in a .txt file, so we can convert the total number of characters to bytes as follows:
3,689,348,814,741,248 bytes = 3,689,348,814,741 kilobytes (KB)
3,689,348,814,741 KB = 3,600,116,533 megabytes (MB)
3,600,116,533 MB = 3,515,203 terabytes (TB)
Therefore, if each line contains 51 characters, 2^67 lines of text would take up approximately 3,515,203 terabytes of space in a .txt file.
As of 2021, it is estimated that Google has over 2.5 million servers located in data centers around the world, with a total storage capacity of around 10 exabytes (10,000,000 terabytes) or more.
So, let us persuade Google to allocate 35% of its storage space to accommodate the data for our website.
The worst discussion I have seen in the entire thread till date is in these 2 to 3 pages.

The last comment x2

[albert0bsd]

The amount of space that 2^67 lines of text would take up in a .txt file depends on the length of each line.
line: 20000000000000000(17 char) 1LgpDjsqkxF9cTkz3UYSbdTJuvbZ45PKvx (34 char) 17+34 = 51
total number of characters as follows:

That is the worst way to store that informacion, to store it you need to store the data in its RAW data fot the address you only need the RMD hash in raw data it is only 20 bytes.

For the privatekey there is two options, don't store the private key because you will not sort the Addresses or Store the private key because you want to Sort the addresses

If you decide to store the private key you only need 9 bytes for it... in that case you only need 29 bytes.

If you decide NOT store the private key you only need 20 bytes for the hash rmd.

[Evillo]

The amount of space that 2^67 lines of text would take up in a .txt file depends on the length of each line.
line: 20000000000000000(17 char) 1LgpDjsqkxF9cTkz3UYSbdTJuvbZ45PKvx (34 char) 17+34 = 51
total number of characters as follows:
2^67 lines * 51 characters per line = 3,689,348,814,741,248 characters
Each character takes up 1 byte of storage in a .txt file, so we can convert the total number of characters to bytes as follows:
3,689,348,814,741,248 bytes = 3,689,348,814,741 kilobytes (KB)
3,689,348,814,741 KB = 3,600,116,533 megabytes (MB)
3,600,116,533 MB = 3,515,203 terabytes (TB)
Therefore, if each line contains 51 characters, 2^67 lines of text would take up approximately 3,515,203 terabytes of space in a .txt file.
As of 2021, it is estimated that Google has over 2.5 million servers located in data centers around the world, with a total storage capacity of around 10 exabytes (10,000,000 terabytes) or more.
So, let us persuade Google to allocate 35% of its storage space to accommodate the data for our website.
The worst discussion I have seen in the entire thread till date is in these 2 to 3 pages.

Who said we're talking about 2^67 ??
I'm talking about 2^256 .. can Google or the whole universe contain that?

[zahid888]

The amount of space that 2^67 lines of text would take up in a .txt file depends on the length of each line.
line: 20000000000000000(17 char) 1LgpDjsqkxF9cTkz3UYSbdTJuvbZ45PKvx (34 char) 17+34 = 51
total number of characters as follows:

That is the worst way to store that informacion, to store it you need to store the data in its RAW data fot the address you only need the RMD hash in raw data it is only 20 bytes.

For the privatekey there is two options, don't store the private key because you will not sort the Addresses or Store the private key because you want to Sort the addresses

If you decide to store the private key you only need 9 bytes for it... in that case you only need 29 bytes.

If you decide NOT store the private key you only need 20 bytes for the hash rmd.

Whether there are 50 bytes or 20 bytes does not matter. Even if there are 20 bytes per line, we would still require 2,146,575 terabytes (TB) of storage space, which is still 25 percent of the entire storage capacity of Google servers. Anyway, let's leave these irrelevant discussions aside. We have people like @ProjectSe7en who are committed to supporting Such a excellent ideas. Let us move on and put an end to this topic.

Who said we're talking about 2^67 ??
I'm talking about 2^256 .. can Google or the whole universe contain that?

As I mentioned before, I would like to reiterate - let us put an end to this discussion. If there is something new to discuss, please share, but increasing the number of pages unnecessarily is not appropriate.

[Evillo]

The amount of space that 2^67 lines of text would take up in a .txt file depends on the length of each line.
line: 20000000000000000(17 char) 1LgpDjsqkxF9cTkz3UYSbdTJuvbZ45PKvx (34 char) 17+34 = 51
total number of characters as follows:

That is the worst way to store that informacion, to store it you need to store the data in its RAW data fot the address you only need the RMD hash in raw data it is only 20 bytes.

For the privatekey there is two options, don't store the private key because you will not sort the Addresses or Store the private key because you want to Sort the addresses

If you decide to store the private key you only need 9 bytes for it... in that case you only need 29 bytes.

If you decide NOT store the private key you only need 20 bytes for the hash rmd.

True! And to be completely blunt about this whole store data thingy, any file over a dozen terabytes is a stupid idea .. because you will not just save the file somewhere; you will also have to "process" it. I don't know about you, but i have dealt with big files before and it's a torture to process huge hard drive data .. torture in terms of time and resources. This is the reason why all cracking programs are checking data on the fly .. shows we fortunately have smart devs.. Also all these "bitcoin private keys" websites are doing it on the fly as well .. they are there not to be scraped or scanned, they are there for you to check keys individually or to grab information for testing reasons.

[hhhhugi]

What is the fastest way to search multiple pubkeys? bsgs or kangaroo?? How many pubkeys can I search at one time?

Tried up to 160,000 pubs on keyhunt BSGS before.

How many private keys did you find successfully?

[Aplos]

Hello 32 bitcoin puzzle community,
I am new to form however i have been following this baffling puzzle for quite some time. Since recently the amount on the puzzle has increased I thought I'd have another crack at it. Far as i can tell many have given up trying to find a algorithm/formula and alternatively focus on brute force methods.
I myself believe there is a algorithm and process to creating this sequence. I have recently discovered a process that seem to be generating very similar sequences but not exact. I wanted to know if other methods have been tried by the community to crack the puzzle other then brute force. if so could someone care to list whats been tried so far. i have tried going through the whole form but its not clear whats been tried and not. Thanks in adavnce.
The process i have discovered does not involve patterns or any mathematical relationships between the terms in the sequence. I understand noone has found a pattern in the sequence.

[GoldTiger69]

Hello 32 bitcoin puzzle community,
I am new to form however i have been following this baffling puzzle for quite some time. Since recently the amount on the puzzle has increased I thought I'd have another crack at it. Far as i can tell many have given up trying to find a algorithm/formula and alternatively focus on brute force methods.
I myself believe there is a algorithm and process to creating this sequence. I have recently discovered a process that seem to be generating very similar sequences but not exact. I wanted to know if other methods have been tried by the community to crack the puzzle other then brute force. if so could someone care to list whats been tried so far. i have tried going through the whole form but its not clear whats been tried and not. Thanks in adavnce.
The process i have discovered does not involve patterns or any mathematical relationships between the terms in the sequence. I understand noone has found a pattern in the sequence.

Will you show us the process you have discovered?

[digaran]

Hello
 I wanted to know if other methods have been tried by the community to crack the puzzle other then brute force. if so could someone care to list whats been tried so far. i have tried going through the whole form but its not clear whats been tried and not. Thanks in adavnce.
The process i have discovered does not involve patterns or any mathematical relationships between the terms in the sequence. I understand noone has found a pattern in the sequence.

Hello there to you friend. How is it going.

You could start from this board called project development in there you should look for any topic including key words such as, cracking,  hunting, solving, vanity search etc.  After that visit this one called development and technical discussion you should do the same as the first board, read away till you get the idea.

Welcome, and happy hunting!

[Aplos]

Thanks for the replies, as you can imagine i want to share my discovery however i fear someone else might bare fruit for my findings before i do. I only discovered this approach yesterday and want to try all ive got to crack the puzzle myself before I share it. I understand I might be counting my eggs before they are laid but i still believe i might be onto something.

what i can do is provide a sequence that was generated by my method to compare with the puzzle. i will do so when i get a day off work. I am by no means a professional coder but i do understand its workings.

[Evillo]

What is the fastest way to search multiple pubkeys? bsgs or kangaroo?? How many pubkeys can I search at one time?

Tried up to 160,000 pubs on keyhunt BSGS before.

How many private keys did you find successfully?

 Zero, Null, Zilch, None, Nil

Welcome to Bitcoin.

[Woz2000]

Isn't it more efficient to search less pub keys over more steps? In other words, doesn't the process to convert the pub key to a comparable value take longer than it takes to generate the next baby step? I limited my search to 1000 keys based on this thought.

What is the fastest way to search multiple pubkeys? bsgs or kangaroo?? How many pubkeys can I search at one time?

Tried up to 160,000 pubs on keyhunt BSGS before.

How many private keys did you find successfully?

 Zero, Null, Zilch, None, Nil

Welcome to Bitcoin.

[WanderingPhilospher]

Isn't it more efficient to search less pub keys over more steps? In other words, doesn't the process to convert the pub key to a comparable value take longer than it takes to generate the next baby step? I limited my search to 1000 keys based on this thought.

What is the fastest way to search multiple pubkeys? bsgs or kangaroo?? How many pubkeys can I search at one time?

Tried up to 160,000 pubs on keyhunt BSGS before.

How many private keys did you find successfully?

 Zero, Null, Zilch, None, Nil

Welcome to Bitcoin.

I think it’s 6 one way, half a dozen the other.

Running one pub key gets you X speed. Running multiple pub keys at once gets you X/# of pubkeys speed.
Ultimately, #125 is too large of a range, whether you run 1 pub or 1000 pubs. But it can help you narrow down ranges IMO