Without source code, there is no trust in your application. It is not known what kind of application you are distributing.

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.😉

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.

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

I haven't tested it on 65 because my code is still for the CPU, 65 would take a long time to confirm it works, but on a GPU up to 68 will be possible. 

Well, let's go, in the next post I will explain all the logic, if anyone wants to give support please feel free if it makes sense. 

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.

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!

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

Actually some more than 100 Million keys/s    

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


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.

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.



Yes of course.

Eu falo um pouco de portugês.

I only develop in C and C++