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

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.

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

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 

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.

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.

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

do you want work together?

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.

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)

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

for CPU coded in which lang?

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

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!

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

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.

Dear friend,  based on developer community, we experience, what in developer mind, only they create for that for gpu, rest just see 1 or 2 pages back lot of basic coder still working on python at CPU level, just see their ideas, script in python back in 1 or 2 pages, albertobsd max created ecctools in c,  even he is good coder for gpu too, but not him or other gpu coder able to create basic ecc tools for gpu, don't take much aspectation for gpu coder community, let world run at python and CPU ,

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. 

#66 I mean I am interested in your "software" but I don't see how these numbers are possible with just 300Mk/s even if you reduced 86% of #66
Are you able to test on #65 as I think #30 is a bit small?
The range I am searching which I have confidence in but have not shared is less than that at 1342426695300956160 out of 36893488147419107000 keys but even this is like 20 years with 3x RTX3080s so I don't understand how #66, #67 and #68 can be found in 1 week without pub key, could you share more info?

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

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