Much further back he talked about how the prog (in your link) uses uint32_t which has a significant chance of causing false positives. to get 65 you'd have to be able to do at least 1<<32. if you do uint64_t (the hashtable wil take up more memory) but you won't get the false positives.
65 000000000000000000000000000000000000000000000001a838b13505b26867 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe
Thanks
How long did it take and how much mem does it require ...
#define GSTEP (1<<29)
is enough or more is needed?
I've just looked back at your previous posts and found out that you have your own code that you are not willing to share
...
I was just wondering if it can be done with this code ? :
https://gist.github.com/jhoenicke/2e39b3c6c49b1d7b216b8626197e4b89
I tried this
#define GSTEP (1<<28)
#define NUMPUBKEYS 1
unsigned char rawpubkeys[NUMPUBKEYS][33] = {
{
0x02,0x30,0x21,0x0c,0x23,0xb1,0xa0,0x47,0xbc,0x9b,0xdb,0xb1,0x34,0x48,0xe6,0x7d,0xed,0xdc,0x10,0x89,0x46,0xde,0x6d,0xe6,0x39,0xbc,0xc7,0x5d,0x47,0xc0,0x21,0x6b,0x1b
} /* 65 */
};
And got this
Found private key 1: 28e6c7bff92dbd1 or 28e6c7c006d242f
obviously wrong
01 0000000000000000000000000000000000000000000000000000000000000001 1BgGZ9tcN4rm9KBzDn7KprQz87SZ26SAMH
02 0000000000000000000000000000000000000000000000000000000000000003 1CUNEBjYrCn2y1SdiUMohaKUi4wpP326Lb
03 0000000000000000000000000000000000000000000000000000000000000007 19ZewH8Kk1PDbSNdJ97FP4EiCjTRaZMZQA
....
60 0000000000000000000000000000000000000000000000000fc07a1825367bbe 1Kn5h2qpgw9mWE5jKpk8PP4qvvJ1QVy8su
61 00000000000000000000000000000000000000000000000013C96A3742F64906 1AVJKwzs9AskraJLGHAZPiaZcrpDr1U6AB
02 0000000000000000000000000000000000000000000000000000000000000003 1CUNEBjYrCn2y1SdiUMohaKUi4wpP326Lb
03 0000000000000000000000000000000000000000000000000000000000000007 19ZewH8Kk1PDbSNdJ97FP4EiCjTRaZMZQA
....
60 0000000000000000000000000000000000000000000000000fc07a1825367bbe 1Kn5h2qpgw9mWE5jKpk8PP4qvvJ1QVy8su
61 00000000000000000000000000000000000000000000000013C96A3742F64906 1AVJKwzs9AskraJLGHAZPiaZcrpDr1U6AB
65 000000000000000000000000000000000000000000000001a838b13505b26867 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe
Code:
Private key : 000000000000000000000000000000000000000000000001a838b13505b26867
Public key : 30210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b e383c4a8ed4fac77c0d2ad737d8499a362f483f8fe39d1e86aaed578a9455dfc
PrKey WIF c.: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZM21gaY8WN2CdwnTG57
Address c. : 52e763a7ddc1aa4fa811578c491c1bc7fd570137
Address c. : 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe
Public key : 30210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b e383c4a8ed4fac77c0d2ad737d8499a362f483f8fe39d1e86aaed578a9455dfc
PrKey WIF c.: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZM21gaY8WN2CdwnTG57
Address c. : 52e763a7ddc1aa4fa811578c491c1bc7fd570137
Address c. : 18ZMbwUFLMHoZBbfpCjUJQTCMCbktshgpe
Thanks
How long did it take and how much mem does it require ...
#define GSTEP (1<<29)
is enough or more is needed?
I've just looked back at your previous posts and found out that you have your own code that you are not willing to share
... I was just wondering if it can be done with this code ? :
https://gist.github.com/jhoenicke/2e39b3c6c49b1d7b216b8626197e4b89
I tried this
#define GSTEP (1<<28)
#define NUMPUBKEYS 1
unsigned char rawpubkeys[NUMPUBKEYS][33] = {
{
0x02,0x30,0x21,0x0c,0x23,0xb1,0xa0,0x47,0xbc,0x9b,0xdb,0xb1,0x34,0x48,0xe6,0x7d,0xed,0xdc,0x10,0x89,0x46,0xde,0x6d,0xe6,0x39,0xbc,0xc7,0x5d,0x47,0xc0,0x21,0x6b,0x1b
} /* 65 */
};
And got this
Found private key 1: 28e6c7bff92dbd1 or 28e6c7c006d242f
obviously wrong