Quote from: Kamoheapohea on Today at 12:05:12 AM

Quote from: james5000 on August 05, 2023, 06:50:57 PM

Quote from: albert0bsd on August 05, 2023, 06:38:11 PM

Quote from: james5000 on August 05, 2023, 02:32:45 PM

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.