Re: Pubkey scaling/subtracting/other tips for reducing search time
I did a test run here: https://pastebin.com/raw/QZj7VSa3
I tried scrolling down from different spots. And I tried these different points with Puzzle 120. The result is negative.
I tried scrolling down from different spots. And I tried these different points with Puzzle 120. The result is negative.
I'm assuming that this is output from https://github.com/albertobsd/keysubtracter , which can only subtract keys but not divide them?
I wonder what would happen if we first divided by one of @brainless magic ecc numbers followed by adding subtracting the pubkey to get one of these numbers of public keys?
2 447 7572 564114
3 596 9536 752152
4 631 10096 1128228
6 894 14304 1504304
8 1192 15144 2256456
12 1262 20192 3008608
16 1788 28608 4512912
24 1893 30288 6017216
32 2384 40384 9025824
48 2524 60576 18051648
64 3576 94019
96 3786 121152
149 4768 188038
192 5048 282057
298 7152 376076
3 596 9536 752152
4 631 10096 1128228
6 894 14304 1504304
8 1192 15144 2256456
12 1262 20192 3008608
16 1788 28608 4512912
24 1893 30288 6017216
32 2384 40384 9025824
48 2524 60576 18051648
64 3576 94019
96 3786 121152
149 4768 188038
192 5048 282057
298 7152 376076
I'm not sure of the significance of these numbers so maybe a backstory on how you came about these numbers could be useful. Does it make the overall search time faster?
