1

[ecdsa123]

1

[NotATether]

I never thought about modulo this way, to be honest.

I think this will work for huge numbers as well, because Bignum libraries have reasonably fast subtraction and division times. These are the inverse operations after you move n and +r to the LHS of the equation.

[NotATether]

what more it implict reduct "safety curve" below 128 bit.

Mind explaining this part for us?

[NotATether]

on by hand for small group my idea is working. (on the paper).

when I will implement in code , will try explain "what is in my mind".
difficult to explain without code. this is just abstact idea. but sometimes abstract idea is working.

It's just that I've never heard of a "safety curve" before, let alone a reduced one. Are you referring to the strength of the elliptic curve in bits i.e. the point coordinate size in memory?