nobody help my? 
Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 275. (Read 229433 times)
I need public key for non find number .. 64, 66 etc nobody help my?
nobody help my? I suppose that keyspaces for #64 must be CE20000000000000:CFAFFFFFFFFFFFFF but I don’t have the resources to check this.
Wait and see.
Wait and see.
To scan this range, it takes 3 years even with 1Gkey/s speed
I suppose that keyspaces for #64 must be CE20000000000000:CFAFFFFFFFFFFFFF but I don’t have the resources to check this.
Wait and see.
Wait and see.
Did anyone solve it or is the Bitcoin still available. I heard that the Russian solved it, is it true? Or is there still a chance that someone can win a 32-bit coin lottery someday. Maybe they will figure out the answer with quantum computing in the next decades. Well someone is going to crack a lot of money from this.
Almost every sentence you have written is wrong. There are no Russians, there is no lottery, quantum computing has nothing to do with this, and nobody will make a lot of money from this transaction. Maybe reading the opening post of another thread will give you the answers:
https://bitcointalksearch.org/topic/m.51860206
Do I understand correctly that someone solved this puzzle and took a prize for themselves? If so, how long did it take to solve the puzzle?
To understand this "puzzle", you need to go to page 1. Then read this: https://bitcointalk.org/index.php?topic=5166284.60
Many people have opened their gold chests and earned a large sum of money from it. However, this is very difficult, and it is harder than what you are thinking.
Do I understand correctly that someone solved this puzzle and took a prize for themselves? If so, how long did it take to solve the puzzle?
To understand this "puzzle", you need to go to page 1. Then read this: https://bitcointalk.org/index.php?topic=5166284.60
Drotika scammer!
he sells this script
https://github.com/beranm14/pollard_rho
https://github.com/Antonkee/Pollard-Rho-kangaroo scammer too, after purchase on satoshidisk you will receive an archive with a password that you do not know!
he sells this script
https://github.com/beranm14/pollard_rho
https://github.com/Antonkee/Pollard-Rho-kangaroo scammer too, after purchase on satoshidisk you will receive an archive with a password that you do not know!
There appears to be several scams like this. That is why we decided to just write our own. The project has been very educational! We have a few more improvements to do then we will be moving our code on to a GPU some time later this year (when we can find the time to work on the project).
https://bitcointalksearch.org/topic/science-fair-project-to-trap-bitcoin-private-keys-using-kangaroos-5173445
Drotika scammer!
he sells this script
https://github.com/beranm14/pollard_rho
https://github.com/Antonkee/Pollard-Rho-kangaroo scammer too, after purchase on satoshidisk you will receive an archive with a password that you do not know!
he sells this script
https://github.com/beranm14/pollard_rho
https://github.com/Antonkee/Pollard-Rho-kangaroo scammer too, after purchase on satoshidisk you will receive an archive with a password that you do not know!
#105 is solved. I'll post the private key later, after learn most significant BTC forks. A checkpoint right now is uncompressed address that corresponds to the same private key: 1JATjHbShdvgkvGHyoRv1vTnEeiibqMVnj.
Thanks very much for the creator of the puzzle! I have learned so many beautiful math at puzzle solving.
Thanks very much for the creator of the puzzle! I have learned so many beautiful math at puzzle solving.
@57e
What hardware did you used, CPU/GPU?
How long the discovery of private key took?
In your opinion the other keys up to a point can be found without huge resources?
I`m thinking that if huge resources are necessary only few people have access to huge amount of processing power.
Thanks!
I have used my own version of CUDA GPU code which almost exactly reproduces Pollard's Kangaroo algorithm published earlier as Python code. Solving #105 takes 1 month of working of GTX 1080ti at 270-275 Mh/s, and last 2 week of work of all my available GPUs (total h/s was approximately 1800Mh/s). So, it was not so simple as the Python code presented. I haven't reached published by j2002ba2 1600Mh/s. I has obtained only 470Mh/s with a cloud GPU server and one Tesla V100. I'm not a good programmer in CUDA, that why.
I guess, huge power is necessary for problems behind #120, as mentioned before by j2002ba2. At least with today state of art of ECDLP. Not only GPU power, but CPU and storage too, because we need to generate a huge amount of distinguished points (it was 24GB of data in my case) and to analyze this data in appropriate time. I guess, it is the reason why #105 was unsolved so long time.
The luck was 25% in my case. Very good luck. I apologize for my English.
Very Nice !
I have a question : how many tame and wild kangaroo's were there in the final tame.txt and wild.txt files?
#105 is solved. I'll post the private key later, after learn most significant BTC forks. A checkpoint right now is uncompressed address that corresponds to the same private key: 1JATjHbShdvgkvGHyoRv1vTnEeiibqMVnj.
Thanks very much for the creator of the puzzle! I have learned so many beautiful math at puzzle solving.
Thanks very much for the creator of the puzzle! I have learned so many beautiful math at puzzle solving.
@57e
What hardware did you used, CPU/GPU?
How long the discovery of private key took?
In your opinion the other keys up to a point can be found without huge resources?
I`m thinking that if huge resources are necessary only few people have access to huge amount of processing power.
Thanks!
I have used my own version of CUDA GPU code which almost exactly reproduces Pollard's Kangaroo algorithm published earlier as Python code. Solving #105 takes 1 month of working of GTX 1080ti at 270-275 Mh/s, and last 2 week of work of all my available GPUs (total h/s was approximately 1800Mh/s). So, it was not so simple as the Python code presented. I haven't reached published by j2002ba2 1600Mh/s. I has obtained only 470Mh/s with a cloud GPU server and one Tesla V100. I'm not a good programmer in CUDA, that why.
I guess, huge power is necessary for problems behind #120, as mentioned before by j2002ba2. At least with today state of art of ECDLP. Not only GPU power, but CPU and storage too, because we need to generate a huge amount of distinguished points (it was 24GB of data in my case) and to analyze this data in appropriate time. I guess, it is the reason why #105 was unsolved so long time.
The luck was 25% in my case. Very good luck. I apologize for my English.
so hi man, would really love to try it out,
would it become available to use for us, wish it was made available for use with gpu, then again,
do you have a readme cause 6609y 8m 12d 19:32:04s this is not working> for me.
thanks man reading a lot and learning a lot here. greetz.
#105 is solved. I'll post the private key later, after learn most significant BTC forks. A checkpoint right now is uncompressed address that corresponds to the same private key: 1JATjHbShdvgkvGHyoRv1vTnEeiibqMVnj.
Thanks very much for the creator of the puzzle! I have learned so many beautiful math at puzzle solving.
Thanks very much for the creator of the puzzle! I have learned so many beautiful math at puzzle solving.
@57e
What hardware did you used, CPU/GPU?
How long the discovery of private key took?
In your opinion the other keys up to a point can be found without huge resources?
I`m thinking that if huge resources are necessary only few people have access to huge amount of processing power.
Thanks!
I have used my own version of CUDA GPU code which almost exactly reproduces Pollard's Kangaroo algorithm published earlier as Python code. Solving #105 takes 1 month of working of GTX 1080ti at 270-275 Mh/s, and last 2 week of work of all my available GPUs (total h/s was approximately 1800Mh/s). So, it was not so simple as the Python code presented. I haven't reached published by j2002ba2 1600Mh/s. I has obtained only 470Mh/s with a cloud GPU server and one Tesla V100. I'm not a good programmer in CUDA, that why.
I guess, huge power is necessary for problems behind #120, as mentioned before by j2002ba2. At least with today state of art of ECDLP. Not only GPU power, but CPU and storage too, because we need to generate a huge amount of distinguished points (it was 24GB of data in my case) and to analyze this data in appropriate time. I guess, it is the reason why #105 was unsolved so long time.
The luck was 25% in my case. Very good luck. I apologize for my English.
Thank you for you answer. Most of us we are not native english speakers so your english is ok.
So this puzzle is a fight between coders. I`m not a coder but I wish good luck to all brilliant coders
Congratulations to the winner. What happened to your forum? Is he available? 57fe
#105 is solved. I'll post the private key later, after learn most significant BTC forks. A checkpoint right now is uncompressed address that corresponds to the same private key: 1JATjHbShdvgkvGHyoRv1vTnEeiibqMVnj.
Thanks very much for the creator of the puzzle! I have learned so many beautiful math at puzzle solving.
Thanks very much for the creator of the puzzle! I have learned so many beautiful math at puzzle solving.
@57e
What hardware did you used, CPU/GPU?
How long the discovery of private key took?
In your opinion the other keys up to a point can be found without huge resources?
I`m thinking that if huge resources are necessary only few people have access to huge amount of processing power.
Thanks!
I have used my own version of CUDA GPU code which almost exactly reproduces Pollard's Kangaroo algorithm published earlier as Python code. Solving #105 takes 1 month of working of GTX 1080ti at 270-275 Mh/s, and last 2 week of work of all my available GPUs (total h/s was approximately 1800Mh/s). So, it was not so simple as the Python code presented. I haven't reached published by j2002ba2 1600Mh/s. I has obtained only 470Mh/s with a cloud GPU server and one Tesla V100. I'm not a good programmer in CUDA, that why.
I guess, huge power is necessary for problems behind #120, as mentioned before by j2002ba2. At least with today state of art of ECDLP. Not only GPU power, but CPU and storage too, because we need to generate a huge amount of distinguished points (it was 24GB of data in my case) and to analyze this data in appropriate time. I guess, it is the reason why #105 was unsolved so long time.
The luck was 25% in my case. Very good luck. I apologize for my English.
#105 is solved. I'll post the private key later, after learn most significant BTC forks. A checkpoint right now is uncompressed address that corresponds to the same private key: 1JATjHbShdvgkvGHyoRv1vTnEeiibqMVnj.
Thanks very much for the creator of the puzzle! I have learned so many beautiful math at puzzle solving.
Thanks very much for the creator of the puzzle! I have learned so many beautiful math at puzzle solving.
@57e
What hardware did you used, CPU/GPU?
How long the discovery of private key took?
In your opinion the other keys up to a point can be found without huge resources?
I`m thinking that if huge resources are necessary only few people have access to huge amount of processing power.
Thanks!
I have used my own version of CUDA GPU code which almost exactly reproduces Pollard's Kangaroo algorithm published earlier as Python code. Solving #105 takes 1 month of working of GTX 1080ti at 270-275 Mh/s, and last 2 week of work of all my available GPUs (total h/s was approximately 1800Mh/s). So, it was not so simple as the Python code presented. I haven't reached published by j2002ba2 1600Mh/s. I has obtained only 470Mh/s with a cloud GPU server and one Tesla V100. I'm not a good programmer in CUDA, that why.
I guess, huge power is necessary for problems behind #120, as mentioned before by j2002ba2. At least with today state of art of ECDLP. Not only GPU power, but CPU and storage too, because we need to generate a huge amount of distinguished points (it was 24GB of data in my case) and to analyze this data in appropriate time. I guess, it is the reason why #105 was unsolved so long time.
The luck was 25% in my case. Very good luck. I apologize for my English.
MeBender - I THANK YOU!
Here are the keyspaces for the remaining unsolved addresses up to #110
#64 = 8000000000000000:FFFFFFFFFFFFFFFF
#66 = 20000000000000000:3FFFFFFFFFFFFFFFF
#67 = 40000000000000000:7FFFFFFFFFFFFFFFF
#68 = 80000000000000000:FFFFFFFFFFFFFFFFF
#69 = 100000000000000000:1FFFFFFFFFFFFFFFFF
#71 = 400000000000000000:7FFFFFFFFFFFFFFFFF
#72 = 800000000000000000:FFFFFFFFFFFFFFFFFF
#73 = 1000000000000000000:1FFFFFFFFFFFFFFFFFF
#74 = 2000000000000000000:3FFFFFFFFFFFFFFFFFF
#76 = 8000000000000000000:FFFFFFFFFFFFFFFFFFF
#77 = 10000000000000000000:1FFFFFFFFFFFFFFFFFFF
#78 = 20000000000000000000:3FFFFFFFFFFFFFFFFFFF
#79 = 40000000000000000000:7FFFFFFFFFFFFFFFFFFF
#80 = 80000000000000000000:FFFFFFFFFFFFFFFFFFFF
#81 = 0100000000000000000000:01FFFFFFFFFFFFFFFFFFFF
#82 = 0200000000000000000000:03FFFFFFFFFFFFFFFFFFFF
#83 = 0400000000000000000000:07FFFFFFFFFFFFFFFFFFFF
#84 = 0800000000000000000000:0FFFFFFFFFFFFFFFFFFFFF
#86 = 2000000000000000000000:3FFFFFFFFFFFFFFFFFFFFF
#87 = 4000000000000000000000:7FFFFFFFFFFFFFFFFFFFFF
#88 = 8000000000000000000000:FFFFFFFFFFFFFFFFFFFFFF
#89 = 010000000000000000000000:01FFFFFFFFFFFFFFFFFFFFFF
#91 = 040000000000000000000000:07FFFFFFFFFFFFFFFFFFFFFF
#92 = 080000000000000000000000:0FFFFFFFFFFFFFFFFFFFFFFF
#93 = 100000000000000000000000:1FFFFFFFFFFFFFFFFFFFFFFF
#94 = 200000000000000000000000:3FFFFFFFFFFFFFFFFFFFFFFF
#96 = 800000000000000000000000:FFFFFFFFFFFFFFFFFFFFFFFF
#97 = 01000000000000000000000000:01FFFFFFFFFFFFFFFFFFFFFFFF
#98 = 02000000000000000000000000:03FFFFFFFFFFFFFFFFFFFFFFFF
#99 = 04000000000000000000000000:07FFFFFFFFFFFFFFFFFFFFFFFF
#101 = 10000000000000000000000000:1FFFFFFFFFFFFFFFFFFFFFFFFF
#102 = 20000000000000000000000000:3FFFFFFFFFFFFFFFFFFFFFFFFF
#103 = 40000000000000000000000000:7FFFFFFFFFFFFFFFFFFFFFFFFF
#104 = 80000000000000000000000000:FFFFFFFFFFFFFFFFFFFFFFFFFF
#106 = 0200000000000000000000000000:03FFFFFFFFFFFFFFFFFFFFFFFFFF
#107 = 0400000000000000000000000000:07FFFFFFFFFFFFFFFFFFFFFFFFFF
#108 = 0800000000000000000000000000:0FFFFFFFFFFFFFFFFFFFFFFFFFFF
#109 = 1000000000000000000000000000:1FFFFFFFFFFFFFFFFFFFFFFFFFFF
#110 = 2000000000000000000000000000:3FFFFFFFFFFFFFFFFFFFFFFFFFFF
#64 = 8000000000000000:FFFFFFFFFFFFFFFF
#66 = 20000000000000000:3FFFFFFFFFFFFFFFF
#67 = 40000000000000000:7FFFFFFFFFFFFFFFF
#68 = 80000000000000000:FFFFFFFFFFFFFFFFF
#69 = 100000000000000000:1FFFFFFFFFFFFFFFFF
#71 = 400000000000000000:7FFFFFFFFFFFFFFFFF
#72 = 800000000000000000:FFFFFFFFFFFFFFFFFF
#73 = 1000000000000000000:1FFFFFFFFFFFFFFFFFF
#74 = 2000000000000000000:3FFFFFFFFFFFFFFFFFF
#76 = 8000000000000000000:FFFFFFFFFFFFFFFFFFF
#77 = 10000000000000000000:1FFFFFFFFFFFFFFFFFFF
#78 = 20000000000000000000:3FFFFFFFFFFFFFFFFFFF
#79 = 40000000000000000000:7FFFFFFFFFFFFFFFFFFF
#80 = 80000000000000000000:FFFFFFFFFFFFFFFFFFFF
#81 = 0100000000000000000000:01FFFFFFFFFFFFFFFFFFFF
#82 = 0200000000000000000000:03FFFFFFFFFFFFFFFFFFFF
#83 = 0400000000000000000000:07FFFFFFFFFFFFFFFFFFFF
#84 = 0800000000000000000000:0FFFFFFFFFFFFFFFFFFFFF
#86 = 2000000000000000000000:3FFFFFFFFFFFFFFFFFFFFF
#87 = 4000000000000000000000:7FFFFFFFFFFFFFFFFFFFFF
#88 = 8000000000000000000000:FFFFFFFFFFFFFFFFFFFFFF
#89 = 010000000000000000000000:01FFFFFFFFFFFFFFFFFFFFFF
#91 = 040000000000000000000000:07FFFFFFFFFFFFFFFFFFFFFF
#92 = 080000000000000000000000:0FFFFFFFFFFFFFFFFFFFFFFF
#93 = 100000000000000000000000:1FFFFFFFFFFFFFFFFFFFFFFF
#94 = 200000000000000000000000:3FFFFFFFFFFFFFFFFFFFFFFF
#96 = 800000000000000000000000:FFFFFFFFFFFFFFFFFFFFFFFF
#97 = 01000000000000000000000000:01FFFFFFFFFFFFFFFFFFFFFFFF
#98 = 02000000000000000000000000:03FFFFFFFFFFFFFFFFFFFFFFFF
#99 = 04000000000000000000000000:07FFFFFFFFFFFFFFFFFFFFFFFF
#101 = 10000000000000000000000000:1FFFFFFFFFFFFFFFFFFFFFFFFF
#102 = 20000000000000000000000000:3FFFFFFFFFFFFFFFFFFFFFFFFF
#103 = 40000000000000000000000000:7FFFFFFFFFFFFFFFFFFFFFFFFF
#104 = 80000000000000000000000000:FFFFFFFFFFFFFFFFFFFFFFFFFF
#106 = 0200000000000000000000000000:03FFFFFFFFFFFFFFFFFFFFFFFFFF
#107 = 0400000000000000000000000000:07FFFFFFFFFFFFFFFFFFFFFFFFFF
#108 = 0800000000000000000000000000:0FFFFFFFFFFFFFFFFFFFFFFFFFFF
#109 = 1000000000000000000000000000:1FFFFFFFFFFFFFFFFFFFFFFFFFFF
#110 = 2000000000000000000000000000:3FFFFFFFFFFFFFFFFFFFFFFFFFFF
racminer - THANK !
I missed those numbers - I just didn’t notice (my mistake)
Congratulations to 57fe on getting # 105.
57fe has proven several times that his method works!
@57fe congrats brother
#105 is solved. I'll post the private key later, after learn most significant BTC forks. A checkpoint right now is uncompressed address that corresponds to the same private key: 1JATjHbShdvgkvGHyoRv1vTnEeiibqMVnj.
Thanks very much for the creator of the puzzle! I have learned so many beautiful math at puzzle solving.
Thanks very much for the creator of the puzzle! I have learned so many beautiful math at puzzle solving.
@57e
What hardware did you used, CPU/GPU?
How long the discovery of private key took?
In your opinion the other keys up to a point can be found without huge resources?
I`m thinking that if huge resources are necessary only few people have access to huge amount of processing power.
Thanks!
So now the race is on between #64 by brute force and #110 by kangaroos!
Jump to: