Quote from: WanderingPhilospher on Today at 12:57:43 AM

Quote from: ssxb on July 29, 2021, 11:49:35 AM

Quote from: NotATether on July 29, 2021, 11:26:51 AM

Quote from: ssxb on July 29, 2021, 10:24:02 AM

can you share script to do these calculations or explain a way please

Again, if you go a few pages back you'll find a division script in Python.

Quote from: NotATether on July 04, 2021, 12:55:24 PM

This was previously posted in this thread but deleted for some reason, it's a snippet from iceland2k14's Github that divides a pubkey by an arbitrary number and returning all the parts in between. I polished it a bit to print the compressed and uncompressed keys: https://gist.github.com/ZenulAbidin/286a652b160086b3b0f184a886ba68ca

Here's the script output when called with a random (uninteresting - with no balance) pubkey, divided by 48. The keys divided by 0, 1, 2, 3 and so on are printed in order:

~snipped

once you use script and devide with 48 , my question is what range than i have to set to scan if i devide 48
and what about if i divide with 96 what range
and what about like odd number 55

I reduced by using subtraction, not division as in icelands that NotATether posted.

If you are reducing a pubkey that is in the 100 bit range, then think of 2^x. To get the 100 bit pubkey down to 95 bit range, you will need to divide by 2^5 (32); if you want it down to 90 bit range, you will need to divide by 2^10 (1,024); if you use an odd number, then the odd number pubkey will be in a range in between the powers of 2; so if you divided by 777 then the 777 pubkey would be in a range somewhere between 2^91 = 2^100 - 2^9 (512) and 2^90 = 2^100 - 2^10 (1,024)

Thanks but may i know how we can do addition and multiplication with each other key and get one key as brainless mentioned ?