Author

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

jr. member
Activity: 69
Merit: 2
Let's go from the beginning so you can follow the reasoning.

when looking over and over all address from 1 to 65 i couldn't see anything that would help, obviously no pattern as we know,
So I simply asked my brother to look at me and yes! he managed to see the obvious, see how simple it is...

if you generate a private key with a reasonable size in the most random way you know, you will see that it will almost never, or even never, have standard characteristics as the friend mentioned on the previous page, such as:

0000, 1234, 4321, ffff.... right?

in the same way, it will be very difficult to have a few or many 1 bits, let's analyze the keys from 1 to 65:

Code:
    private key           bits zeros    bits ones

                 1             0           1
                 3             0           2
                 7             0           3
                 8             3           1
                15             3           2
                31             3           3
                4c             4           3
                e0             5           3
               1d3             3           6
               202             8           2
               483             7           4
               a7b             4           8
              1460             9           4
              2930             9           5
              68f3             6           9
              c936             8           8
             1764f             6          11
             3080d            12           6
             5749f             7          12
             d2c55            10          10
            1ba534            10          11
            2de40f            10          12
            556e52            11          12
            dc2a04            15           9
           1fa5ee5             8          17
           340326e            15          11
           6ac3875            13          14
           d916ce8            14          14
          17e2551e            13          16
          3d94cd64            14          16
          7d4fe747            10          21
          b862a62e            17          15
         1a96ca8d8            17          16
         34a65911d            18          16
         4aed21170            20          15
         9de820a7c            19          17
        1757756a93            15          22
        22382facd0            21          17
        4b5f8303e9            19          20
        e9ae4933d6            18          22
       153869acc5b            20          21
       2a221c58d8f            23          19
       6bd3b27c591            19          24
       e02b35a358f            22          22
      122fca143c05            26          19
      2ec18388d544            27          19
      6cd610b53cba            23          24
      ade6d7ce3b9b            17          31
     174176b015f4d            24          25
     22bd43c2e9354            26          24
     75070a1a009d4            32          19
     efae164cb9e3c            22          30
    180788e47e326c            29          24
    236fb6d5ad1f43            22          32
    6abe1f9b67e114            24          31
    9d18b63ac4ffdf            22          34
   1eb25c90795d61c            28          29
   2c675b852189a21            33          25
   7496cbb87cab44f            26          33
   fc07a1825367bbe            28          32
  13c96a3742f64906            32          29
  363d541eb611abee            28          34
  7cce5efdaccf6808            27          36
  f7051f27b09112d4            34          30
 1a838b13505b26867            36          29

it is very clear that the larger the interval the less chance that a key has too many or too few bits (if they are randomly generated, of course)
some keys even have the same number of bit 1 and bit 0 having an exact 50% rate.

let's say we're going to try 65, first we'd try ~50% right?
as it is odd let's assume it is 33 bits 0 and 32 bits 1, in the first interval would not be found, since we know the numbers of bit 1 and bit 0.

with a multi process we can search for the following ranges:
0 = 33 and 1 = 32
0 = 31 and 1 = 34
0 = 30 and 1 = 35
0 = 29 and 1 = 36
0 = 28 and 1 = 37

and their inverses

0 = 32 and 1 = 33
0 = 34 and 1 = 31
0 = 35 and 1 = 30
0 = 36 and 1 = 29
0 = 37 and 1 = 28

eliminating all other intervals that are very unlikely to be our much sought after key
66 is not too far from 65 with possible 1 and 0 bit intervals like:

0 = 33 and 1 = 33
0 = 32 and 1 = 34
0 = 31 and 1 = 35
0 = 30 and 1 = 36
0 = 29 and 1 = 37

and their inverses

0 = 33 and 1 = 33
0 = 34 and 1 = 32
0 = 35 and 1 = 31
0 = 36 and 1 = 30
0 = 37 and 1 = 29

It makes sense?

this is just a small start of what I got in about 2 months, I identified extra patterns, improved and adapted operations on the elliptic curve secp256k1 to speed up the search, but as I said I'm stuck at 250,000 key/s, I believe memory issues

help me to continue Smiley
1JamesJ2H2myei94NswaBATqEsBhATENSU
jr. member
Activity: 57
Merit: 1

my code is ready and running now for puzzle 66, but with 250,000 keys per second it will take 1 to 10 months  Undecided, I'm improving to have at least 1Mk/s, a dream would be 300Mk/s  Smiley


What is your code running on ? and is it on github?
is running in cuda c++ with a gtx 1650 4GB

Unfortunately I can't share the code yet, because as I said a few days ago, people with more resources or experience will find the keys and my work for months will have been in vain, I dedicated everything to this project and I am absolutely sure that This is the way.

skip screen prints in your code and focus only on the result, this will speed up you.
newbie
Activity: 49
Merit: 0

my code is ready and running now for puzzle 66, but with 250,000 keys per second it will take 1 to 10 months  Undecided, I'm improving to have at least 1Mk/s, a dream would be 300Mk/s  Smiley


What is your code running on ? and is it on github?
is running in cuda c++ with a gtx 1650 4GB

Unfortunately I can't share the code yet, because as I said a few days ago, people with more resources or experience will find the keys and my work for months will have been in vain, I dedicated everything to this project and I am absolutely sure that This is the way.

Okay that's nice.
Take all the time you need, get 66,67,68 and 69 then share the code when you have gotten enough resources. The sky is the limit. as of right now, if everyone else were thinking the same way you're thinking, Pollard Kangaroo would still be hidden until now, he'd be hoping to solve all the puzzle before releasing the code. what do you think the puzzles are about? 1+1?
The 1+1 stages are all over right now. the bruteforcing part we currently are trying to solve is 66 bits. i know you have a magical code though but if it takes you 1 year on your code it takes everyone else nothing more than 100 years, in regard to the resources or more years for some other people without the resources needed, if you waste too much money to get the resources and it turned out   to be unprofitable. what point does it make then? because after you calculate the expenses to run all that machine then you would understand what it's called. left alone, 67 bits is double 66 bits so imagine you will take 2 years to solve that one.
If the resources stops becoming profitable then what point does it make trying to bruteforce a key that won't yield any profit after expenses and time spent has been calculated. we can all let you know that puzzles are for fun and not for funds. when you finally realize that, you will think twice after wasting about 5 years using your code without finding any keys whereas if you had made it public, someone might develop it and make it better for your hardwork.

You're right, I'm just sad to think that all the work wouldn't be paid, I really bet a lot on it, but I'll share the logic and count on everyone's humility.


Hello.
It would be interesting to understand the logic of how you managed to reduce the number of possible keys.
Respect for your work.
jr. member
Activity: 69
Merit: 2

my code is ready and running now for puzzle 66, but with 250,000 keys per second it will take 1 to 10 months  Undecided, I'm improving to have at least 1Mk/s, a dream would be 300Mk/s  Smiley


What is your code running on ? and is it on github?
is running in cuda c++ with a gtx 1650 4GB

Unfortunately I can't share the code yet, because as I said a few days ago, people with more resources or experience will find the keys and my work for months will have been in vain, I dedicated everything to this project and I am absolutely sure that This is the way.

Okay that's nice.
Take all the time you need, get 66,67,68 and 69 then share the code when you have gotten enough resources. The sky is the limit. as of right now, if everyone else were thinking the same way you're thinking, Pollard Kangaroo would still be hidden until now, he'd be hoping to solve all the puzzle before releasing the code. what do you think the puzzles are about? 1+1?
The 1+1 stages are all over right now. the bruteforcing part we currently are trying to solve is 66 bits. i know you have a magical code though but if it takes you 1 year on your code it takes everyone else nothing more than 100 years, in regard to the resources or more years for some other people without the resources needed, if you waste too much money to get the resources and it turned out   to be unprofitable. what point does it make then? because after you calculate the expenses to run all that machine then you would understand what it's called. left alone, 67 bits is double 66 bits so imagine you will take 2 years to solve that one.
If the resources stops becoming profitable then what point does it make trying to bruteforce a key that won't yield any profit after expenses and time spent has been calculated. we can all let you know that puzzles are for fun and not for funds. when you finally realize that, you will think twice after wasting about 5 years using your code without finding any keys whereas if you had made it public, someone might develop it and make it better for your hardwork.

You're right, I'm just sad to think that all the work wouldn't be paid, I really bet a lot on it, but I'll share the logic and count on everyone's humility.
jr. member
Activity: 75
Merit: 5

my code is ready and running now for puzzle 66, but with 250,000 keys per second it will take 1 to 10 months  Undecided, I'm improving to have at least 1Mk/s, a dream would be 300Mk/s  Smiley


What is your code running on ? and is it on github?
is running in cuda c++ with a gtx 1650 4GB

Unfortunately I can't share the code yet, because as I said a few days ago, people with more resources or experience will find the keys and my work for months will have been in vain, I dedicated everything to this project and I am absolutely sure that This is the way.

Okay that's nice.
Take all the time you need, get 66,67,68 and 69 then share the code when you have gotten enough resources. The sky is the limit. as of right now, if everyone else were thinking the same way you're thinking, Pollard Kangaroo would still be hidden until now, he'd be hoping to solve all the puzzle before releasing the code. what do you think the puzzles are about? 1+1?
The 1+1 stages are all over right now. the bruteforcing part we currently are trying to solve is 66 bits. i know you have a magical code though but if it takes you 1 year on your code it takes everyone else nothing more than 100 years, in regard to the resources or more years for some other people without the resources needed, if you waste too much money to get the resources and it turned out   to be unprofitable. what point does it make then? because after you calculate the expenses to run all that machine then you would understand what it's called. left alone, 67 bits is double 66 bits so imagine you will take 2 years to solve that one.
If the resources stops becoming profitable then what point does it make trying to bruteforce a key that won't yield any profit after expenses and time spent has been calculated. we can all let you know that puzzles are for fun and not for funds. when you finally realize that, you will think twice after wasting about 5 years using your code without finding any keys whereas if you had made it public, someone might develop it and make it better for your hardwork.

PLEASE IF YOU FIND A WAY TO COMPLETE THE 66 BITS PUZZLE TAKE THE PRIVATE KEY YOUVE EARNED IT BUT PLEASE TAKE THIS TO HEART THAT WHAT A WISEMAN ABOVE HINTED AT WILL SAVE YOU HUNDRED FOURTY OF THE TIME OF WHAT YOU ARE TRYING TO ACCOMPLISH IN THE END PLEASE JUST HELP US MAKE THE CODE PUBLIC INSTEAD OF JUST WAISTING YOUR LIFETIME BY HUNTING FOR WORTHLESS PRICES AND THROPHIES LIKE THIS I'M SORRY TO TELL YOU THAT YOUVE COME THIS FAR BUT YOU'LL NEVER FINISH PUZZLE 66 IF YOU DON'T MAKE THE CODE PUBLIC FOR DEVELOPING I EXPECT YOU TO SAY BULLSHIT WELL DENIAL IS THE MOST PREDICTABLE OF ALL HUMAN RESPONSES
jr. member
Activity: 75
Merit: 5

my code is ready and running now for puzzle 66, but with 250,000 keys per second it will take 1 to 10 months  Undecided, I'm improving to have at least 1Mk/s, a dream would be 300Mk/s  Smiley


What is your code running on ? and is it on github?
is running in cuda c++ with a gtx 1650 4GB

Unfortunately I can't share the code yet, because as I said a few days ago, people with more resources or experience will find the keys and my work for months will have been in vain, I dedicated everything to this project and I am absolutely sure that This is the way.

Okay that's nice.
Take all the time you need, get 66,67,68 and 69 then share the code when you have gotten enough resources. The sky is the limit. as of right now, if everyone else were thinking the same way you're thinking, Pollard Kangaroo would still be hidden until now, he'd be hoping to solve all the puzzle before releasing the code. what do you think the puzzles are about? 1+1?
The 1+1 stages are all over right now. the bruteforcing part we currently are trying to solve is 66 bits. i know you have a magical code though but if it takes you 1 year on your code it takes everyone else nothing more than 100 years, in regard to the resources or more years for some other people without the resources needed, if you waste too much money to get the resources and it turned out   to be unprofitable. what point does it make then? because after you calculate the expenses to run all that machine then you would understand what it's called. left alone, 67 bits is double 66 bits so imagine you will take 2 years to solve that one.
If the resources stops becoming profitable then what point does it make trying to bruteforce a key that won't yield any profit after expenses and time spent has been calculated. we can all let you know that puzzles are for fun and not for funds. when you finally realize that, you will think twice after wasting about 5 years using your code without finding any keys whereas if you had made it public, someone might develop it and make it better for your hardwork.
jr. member
Activity: 69
Merit: 2

my code is ready and running now for puzzle 66, but with 250,000 keys per second it will take 1 to 10 months  Undecided, I'm improving to have at least 1Mk/s, a dream would be 300Mk/s  Smiley


What is your code running on ? and is it on github?
is running in cuda c++ with a gtx 1650 4GB

Unfortunately I can't share the code yet, because as I said a few days ago, people with more resources or experience will find the keys and my work for months will have been in vain, I dedicated everything to this project and I am absolutely sure that This is the way.
newbie
Activity: 1
Merit: 0
Before BitCrack was developed, everything else happening now could feel more like what James is trying to say right now until might all sound like bullshit if someone that was only scanning keys at the range of a couple hundred thousand keys per second if Brichard had brought that idea to the table to him before developing the code. and right now even WanderingPhilosopher and Albertobsd were abled to develop something even slightly faster than that almost 1.5 times the idea that could has sounded stupid back in the days. We all understand that ideas might look very shabby sometimes when you hear them when they actually haven't been put to test and sometimes those ideas might actually be shabby and rough. It just needs some amount of hard work and the sky is the limit. We have Kangaroo also solving these formulas like it's nothing but before these codes were developed, so much hard work and thoughtful ideas came together to achieve them. If it's worth a thought and logical then it's worth giving a try. Let us just give this a try as suggested and it could actually be the solution that everyone else has been looking for. We have the endormophism in keyhunt "In few words for elliptic curves, an endomorphism is a function that maps points on the curve to other points on the same curve.

One kind of Endomorphism is the Point negation by example the privatekey from puzzle 64"
that was an idea that actually got the code to go even faster than the norm without activation of endormophism.
James could have something logical up his sleeves and we all don't know where this could be leading but let's just hope there's a reasonable amount of solutions this would solve much more easily.

my code is ready and running now for puzzle 66, but with 250,000 keys per second it will take 1 to 10 months  Undecided, I'm improving to have at least 1Mk/s, a dream would be 300Mk/s  Smiley


What is your code running on ? and is it on github?
jr. member
Activity: 69
Merit: 2
Before BitCrack was developed, everything else happening now could feel more like what James is trying to say right now until might all sound like bullshit if someone that was only scanning keys at the range of a couple hundred thousand keys per second if Brichard had brought that idea to the table to him before developing the code. and right now even WanderingPhilosopher and Albertobsd were abled to develop something even slightly faster than that almost 1.5 times the idea that could has sounded stupid back in the days. We all understand that ideas might look very shabby sometimes when you hear them when they actually haven't been put to test and sometimes those ideas might actually be shabby and rough. It just needs some amount of hard work and the sky is the limit. We have Kangaroo also solving these formulas like it's nothing but before these codes were developed, so much hard work and thoughtful ideas came together to achieve them. If it's worth a thought and logical then it's worth giving a try. Let us just give this a try as suggested and it could actually be the solution that everyone else has been looking for. We have the endormophism in keyhunt "In few words for elliptic curves, an endomorphism is a function that maps points on the curve to other points on the same curve.

One kind of Endomorphism is the Point negation by example the privatekey from puzzle 64"
that was an idea that actually got the code to go even faster than the norm without activation of endormophism.
James could have something logical up his sleeves and we all don't know where this could be leading but let's just hope there's a reasonable amount of solutions this would solve much more easily.

my code is ready and running now for puzzle 66, but with 250,000 keys per second it will take 1 to 10 months  Undecided, I'm improving to have at least 1Mk/s, a dream would be 300Mk/s  Smiley
jr. member
Activity: 75
Merit: 5
with 1Mk/s i have a key off 66 puzzle in max 10 days
with 300Mk/s i have a key in 10 hours
if albertobsd want work with me, we can make a call and divide 50/50 the 66, 67 and 68, maybe more

I think that your calculations are some wrong, what formula do you use?
According to my research with 1 Million keys/s the puzzle 66 can take up to 1 million 169 thousand years.

This is the secret, all the techniques that have been tried will not solve 66 onwards, but we can work with my strategy, with a good enough rate even the first blocks wallets can be broken in months.

I assume you try to filter out all privatekeys that do not seem random enough. Like repeating patterns in any base (...1111..., ...2222..., ...1234..., 0x...aaaa...). This will reduce the searchspace. But I think the benefit will also decrease exponentially, so you will have to search like 64.5 bit instead of 65 bit for 66 bit puzzle.

Before BitCrack was developed, everything else happening now could feel more like what James is trying to say right now until might all sound like bullshit if someone that was only scanning keys at the range of a couple hundred thousand keys per second if Brichard had brought that idea to the table to him before developing the code. and right now even WanderingPhilosopher and Albertobsd were abled to develop something even slightly faster than that almost 1.5 times the idea that could has sounded stupid back in the days. We all understand that ideas might look very shabby sometimes when you hear them when they actually haven't been put to test and sometimes those ideas might actually be shabby and rough. It just needs some amount of hard work and the sky is the limit. We have Kangaroo also solving these formulas like it's nothing but before these codes were developed, so much hard work and thoughtful ideas came together to achieve them. If it's worth a thought and logical then it's worth giving a try. Let us just give this a try as suggested and it could actually be the solution that everyone else has been looking for. We have the endormophism in keyhunt "In few words for elliptic curves, an endomorphism is a function that maps points on the curve to other points on the same curve.

One kind of Endomorphism is the Point negation by example the privatekey from puzzle 64"
that was an idea that actually got the code to go even faster than the norm without activation of endormophism.
James could have something logical up his sleeves and we all don't know where this could be leading but let's just hope there's a reasonable amount of solutions this would solve much more easily.
jr. member
Activity: 47
Merit: 12
gmaxwell creator of 1000 BTC puzzl + Pinapple fund
with 1Mk/s i have a key off 66 puzzle in max 10 days
with 300Mk/s i have a key in 10 hours
if albertobsd want work with me, we can make a call and divide 50/50 the 66, 67 and 68, maybe more

I think that your calculations are some wrong, what formula do you use?
According to my research with 1 Million keys/s the puzzle 66 can take up to 1 million 169 thousand years.

This is the secret, all the techniques that have been tried will not solve 66 onwards, but we can work with my strategy, with a good enough rate even the first blocks wallets can be broken in months.

I assume you try to filter out all privatekeys that do not seem random enough. Like repeating patterns in any base (...1111..., ...2222..., ...1234..., 0x...aaaa...). This will reduce the searchspace. But I think the benefit will also decrease exponentially, so you will have to search like 64.5 bit instead of 65 bit for 66 bit puzzle.
jr. member
Activity: 69
Merit: 2
with 1Mk/s i have a key off 66 puzzle in max 10 days
with 300Mk/s i have a key in 10 hours
if albertobsd want work with me, we can make a call and divide 50/50 the 66, 67 and 68, maybe more

I think that your calculations are some wrong, what formula do you use?
According to my research with 1 Million keys/s the puzzle 66 can take up to 1 million 169 thousand years.

This is the secret, all the techniques that have been tried will not solve 66 onwards, but we can work with my strategy, with a good enough rate even the first blocks wallets can be broken in months.
hero member
Activity: 862
Merit: 662
with 1Mk/s i have a key off 66 puzzle in max 10 days
with 300Mk/s i have a key in 10 hours
if albertobsd want work with me, we can make a call and divide 50/50 the 66, 67 and 68, maybe more

I think that your calculations are some wrong, what formula do you use?
According to my research with 1 Million keys/s the puzzle 66 can take up to 1 million 169 thousand years.

Code:
>>> 2**65/1000000/60/60/24/365
1169884.834710144

do you want work together?

Yes of course.

Eu falo um pouco de portugês.

I only develop in C and C++
jr. member
Activity: 69
Merit: 2
... and you can get 27,000,000 on high end CPU.

Actually some more than 100 Million keys/s     Cheesy

By the way my fists test also start with some 50 Thousand keys/s

i finished a first version for gpu and i get 250.000 keys per second for now

Please don't start a code for GPU when you don't even reach the max limit for CPU, a shitty code in CPU will only lead a shitty code on GPU.


do you want work together?
hero member
Activity: 862
Merit: 662
... and you can get 27,000,000 on high end CPU.

Actually some more than 100 Million keys/s     Cheesy

By the way my fists test also start with some 50 Thousand keys/s

i finished a first version for gpu and i get 250.000 keys per second for now

Please don't start a code for GPU when you don't even reach the max limit for CPU, a shitty code in CPU will only lead a shitty code on GPU.
jr. member
Activity: 61
Merit: 6

python for cpu.
now i have 50.000 key per second on cpu
i finished a first version for gpu and i get 250.000 keys per second for now
Don't waste your time, Keyhunt(CPU) can start with 1,000,000 key/s and you can get 27,000,000 on high end CPU.
BitCrack and KeyHuntCuda can get 1,000,000,000  key/s with mid range GPU.

Just pick up one of them, or you can change the code as you wash(its open source at the end)
jr. member
Activity: 69
Merit: 2

for CPU coded in which lang?

How many keys/s do you get with your computer?

python for cpu.
now i have 50.000 key per second on cpu
i finished a first version for gpu and i get 250.000 keys per second for now
jr. member
Activity: 59
Merit: 1
I'm developing brute force software following a slightly more coherent logic, I'll post the code soon.  Grin

support the project:  Wink
1JamesJ2H2myei94NswaBATqEsBhATENSU
Cool project, keeping an eye on this one!
Btw what project?  first show us what you got, then we'll talk about support, in case you haven't noticed, people are here to find money not give it away.

unfortunately by posting the code people with more knowledge will gain an advantage, so first I'll break down the 66, 67 and 68 puzzle before explaining how it works.
If you manage to solve puzzles 66, 67 and 68, what guarantees would we have that someone would see your code? If you already have the code, why do you want sponsorship? Personally, if I invest in a project, I do it on my own. If I have positive results, I will take my profit from there. So, I just wish you luck and that's it. I can't trust you and I think that most of the members on this forum would have no reason to trust you.
My code currently runs on the CPU, but we all know that for the next puzzles it needs to be made to run on the GPU, if anyone with CUDA knowledge is interested in splitting 50/50 we can work together.
I guarantee that with a rate of 300 Mk/s we break the 66, 67 and 68 in one week

for CPU coded in which lang?

How many keys/s do you get with your computer?
vhh
newbie
Activity: 14
Merit: 2
I'm developing brute force software following a slightly more coherent logic, I'll post the code soon.  Grin

support the project:  Wink
1JamesJ2H2myei94NswaBATqEsBhATENSU

Sorry but when you put "brute force" and "coherent logic" in the same sentence , the result will be "incoherent". Brute force is the lack of a algorithm that has a logic; if there is one, then the logic part comes in. For #66 there is no other way of cracking it apart from brute force ! Any reduction technique that you think it will work, it won't,  because all we have is the output of RIPEMD160(SHA256(Public Key)). Unless you broke SHA256 and RIPEMD160 all together and somehow managed to recreate the 256 bits input from a 160 bits output, then this is pointless.  As you could see from other posts, people have tried already all sorts of techniques : statistical analysis regarding keys distribution in a certain range, "magic" relationships between wallet keys (with or without the knowledge of Pub Key), etc.

Try to read more about address generation process. One you've done, move on to the signature generation part where you can read about other interesting potential vulnerabilities like nonce reuse , nonce share , lattices and so on ! You will see how interesting the secp256k1 curve really is !

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

Cheers!
jr. member
Activity: 69
Merit: 2
Just for comparison purposes, I tested it with puzzle 30:

we know the range is 20000000:3fffffff
total of 536,870,911 possible keys

I reduced it to approximately 77,000,000 or -85.66%

based on the same calculations I suppose the 66 is reduced to about 27 trillion keys
Reduced what exactly, addresses? You don't have public key, so reducing whatever you think you reduced is not gonna work. But hey, I wish you are up to something and really hope to find the keys you are looking for.

Yes, I reduced the number of possible addresses.
Thanks, I'll find it.
Jump to: