The site does not make a clear declaration but my understanding is that this is named point P. The core of all bitcoin calculations. Is this correct?
...
For example,
If the private key (represented in base 10) is: 7
Then the step to generate the public key is: G + G + G + G + G + G + G
This looks like a pretty good explanation about how elliptic curve point addition is done with finite fields:
https://www.rareskills.io/post/elliptic-curves-finite-fieldsWonderful, the comment about adding in G (effectively multiplying) is something I really needed to see. It has been worded in different ways and I was suspecting that is the situation. Now I am reasonably confident.
As I add in G multiple times, the results will become larger than 256 bits and will require a modulo operation to reduce its size. I forget the name of that constant, p I believe. The calculations will require thousands of additions, arithmetically changed into multiplications, and the numbers will exceed 256 bits.
What is the threshold to apply the modulus operation?
From memory at the moment, the site that mentioned the modulus operations showed the equation with the mod operation on both sides of the = character. Is each side done independently, or both at the same time.
That leads to the question: Will there ever be a time to truncate or round off numbers? Will that be a truncate or round off operation?
Now to visit the mentioned site.
Thank you for taking the time to reply.