On a related note: I'm assuming that my "workaround" for misaligned address bug on 2xxx and 3xxx series cards is working for you? (I never had thes cards, so I couldn't check myself). I'm assuming it's working for you because you published speed specs, but I just want to make sure it doesn't crash mid-computation.
Honestly speaking I did not launch very long computations, so I cannot say if it crashes after one or seven hours, but for a few minutes it works smoothly

I think I just wanted to have a ready solution to be build with newer cuda and for the higher ccap.
Honest question, why are people still using bitcrack with rtx 30xx or 20xx cards? Performance is "horrible" compared to software that does same thing...unless it's for the "stride" function, which is hit and miss if searching for an actual private key.
Which software you talk about? Is there any other reliable "sequential key checker"?
Talking about stride - of course some people used it as a "random shortcut" and it is stupid, I agree. But for a long time it was also the fastest tool for WIF solving with characters missing at the beginning.
Times they are a-changin', that's right, now we have WifSolverCuda and that other tool which is told to be faster than BitCrack, but still it is a good piece of software.
Is it sequential? I thought it spread out the threads according to -b - t- -p numbers...I am sure it does spread out, then check sequentially. The other software is the modified vanity search and keyhunt.
Any who, I was just wandering...lol, it's been forever since I quit using bitcrack due to the errors and drivers (I would have to roll back drivers to use it). Biggest advantage to bitcrack was it allowed the use of amd cards, but even that was buggy. Bitcrack developer is a great programmer; he has made some impressive tools to pool resources for brute force and kangaroo. I would still love to get Brichard's source code for his kangaroo program!