Keyhunt - development requests - bug reports

[albert0bsd]

the RAM is only for BSGS

[Tofee]

the RAM is only for BSGS

If I RIPMED160 hash of my target address and use bags mode then how do I calculate the number which you have shown in your post above. Please explain. Thanks for your prompt reply. Appreciate it.

[albert0bsd]

If I RIPMED160 hash of my target address and use bags mode then how do I calculate the number which you have shown in your post above. Please explain. Thanks for your prompt reply. Appreciate it.

BSGS mode is for Public keys ONLY

RMD160 hash is different from a Public keys.

Please READ this link 4 Times before ask your next question: https://www.oreilly.com/library/view/mastering-bitcoin/9781491902639/ch04.html

[Tofee]

If I RIPMED160 hash of my target address and use bags mode then how do I calculate the number which you have shown in your post above. Please explain. Thanks for your prompt reply. Appreciate it.

BSGS mode is for Public keys ONLY

RMD160 hash is different from a Public keys.

Please READ this link 4 Times before ask your next question: https://www.oreilly.com/library/view/mastering-bitcoin/9781491902639/ch04.html

Thanks

[benjaniah]

Hi Alberto

Would you consider adding a stride option that works in address and vanity mode?

My use case - I've found a good amount of 13zb1hQbWV prefix matches for puzzle 66 so far. When I convert their hex key into their base10 decimal number, I notice many of them (about 1/3) have a factor of 13 and/or 17. An example is 3FEE2509944801483 (13zb1hQbWVECopz4XMEYH8e2t2gX4v4Us3) = (decimal) 73706563070708421763 = 7 × 13 × 809962231546246393. What I would like to be able to do is start at a given key, increment by some stride value (in my case, 13 or 17), check that key for address/vanity match, and repeat to the end of the given range. Would be great if a decrement by x value stride option was available also.

I looked at the code but I have no clue how to make the changes, I'm sure it would take only a few minutes of your genius brain to add.

BitCrack has such a stride option and runs on GPU's however it only searches for full address matches, so there's no way for me to find prefix matches using it, Keyhunt I think it would be a nice add. Maybe there is a fork of vanitysearch out there with a stride option but I haven't been able to find it.

Thanks in advance, no worries if its not something you feel like adding, in that case I might be able to "chatgpt" it, haha.

cheers

[albert0bsd]

Would you consider adding a stride option that works in address and vanity mode?

Well It is not so simple, i already try it before but my first code was wrong

My use case - I've found a good amount of 13zb1hQbWV prefix matches for puzzle 66 so far. When I convert their hex key into their base10 decimal number, I notice many of them (about 1/3) have a factor of 13 and/or 17. An example is 3FEE2509944801483 (13zb1hQbWVECopz4XMEYH8e2t2gX4v4Us3) = (decimal) 73706563070708421763 = 7 × 13 × 809962231546246393.

Nice finding, from a statistical point of view, is your data set Significant?

In the 66 bit space maybe there around of 12344 address that start with 13zb1hQbWV, so I don't know how many we require so demonstrate that those prime factors are relevant or not.

Another thing is that there is no relationship between the prime factors of a private key and the generated address prefix, I can found a lot of address that aren't related to 13zb1hQbWV and have those factors, so the number of "(about 1/3)" is just some statistical or probabilistic

According to some research that i just did the percentage of numbers that has 11 or 13 as factor is near to 20%, that may vary from one rank to another

I bet that half of your data set has 2 as prime factor and other 1/3 has 3 as prime factor no?

I really may consider to add the stride option if you share your data set with me in public or in private.