I recommend the python module ICE secp256k1 has no N limits, it will give you the exact results even when these results are negative or over the imposed limit. An example, the Bitcoin module, gives erroneous results when it comes to negative values or above the imposed limit. Let's remember that numbers are infinite and that a program only recognizes from 1-10, for example, does not mean that you cannot add 4+7 or that 11 does not exist.
You are making yourself a professional user, even though no one of us are.
Even if you divide, multiply, add, subtract a key million of times to get back to the targeted key, you'll not find an single answer for the new values. Because they will still be represented as 255 bits, so the complexity did not changed at all. You just moved the targeted key from A to B, with absolutely the same complexity.
no bro, I don't move the key without differences, as if I were using simple additions and subtractions, I reduce many bits (the beautiful thing about maths, things happen as if it were magic), my problem is that my algorithm is not perfect (yet, or so I want to believe) I have not found a way to reduce more without the need to create thousands of keys, and also that I was born in a poor country and my resources to scan that bit limit me. therefore it is not like you say that there is no difference, there are differences, only you do not know it.