Thank you for being active lately and answering most people's question.
I have a question. I hope you can help me and give me the right explanation, because it needs calculations.
I'm trying to understand and learn stride function more and more and trying to see the exact differences between stride and random functions.
I would love to use puzzle #110 as an example. Puzzle 110's range is between 2000000000000000000000000000 - 4000000000000000000000000000
Real private key of #110: 35C0D7234DF7DEB0F20CF7062444
Can you show me the calculations steps that you perform to get that HEX stride to be able to instantly jump from starting key 2000000000000000000000000000 to exact 35C0D7234DF7DEB0F20CF7062444? This would be my wish.
Many thanks.
Stride = 15C0D7234DF7DEB0F20CF7062444 (hex) or 441208990837133718981428417799236 (decimal) I believe bitcrack takes both but maybe just hex.
Calculations:
start key = 2000000000000000000000000000 or 649037107316853453566312041152512 in decimal
private key = 35C0D7234DF7DEB0F20CF7062444 or 1090246098153987172547740458951748 decimal
stride to get right to the key = 1090246098153987172547740458951748 - 649037107316853453566312041152512 = 441208990837133718981428417799236 or 15C0D7234DF7DEB0F20CF7062444 in hex
Make sense?