Bitcoin puzzle transaction ~32 BTC prize to who solves it

[digaran]

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.

[1715406987]

1715406987

[1715406987]

1715406987

[james5000]

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.

[vhh]

I'm developing brute force software following a slightly more coherent logic, I'll post the code soon.  

support the project:  
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!

[ProjectSe7en]

I'm developing brute force software following a slightly more coherent logic, I'll post the code soon. 

support the project: 
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?

[james5000]

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

[7isce]

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)

[albert0bsd]

... and you can get 27,000,000 on high end CPU.

Actually some more than 100 Million keys/s    

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.

[james5000]

... and you can get 27,000,000 on high end CPU.

Actually some more than 100 Million keys/s    

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?

[albert0bsd]

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++

[james5000]

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.

[Kamoheapohea]

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.

[bestie1549]

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.

[james5000]

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  , I'm improving to have at least 1Mk/s, a dream would be 300Mk/s 

[zodmode]

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  , I'm improving to have at least 1Mk/s, a dream would be 300Mk/s 

What is your code running on ? and is it on github?

[james5000]

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

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.

[bestie1549]

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

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.

[bestie1549]

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

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

[james5000]

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

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.

[Denis_Hitov]

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

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.

[lordfrs]

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

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.