Are you working through/have completed Jimmy Song’s Programming Bitcoin? I’m looking for study buddies, let’s make a geek squad and help each other.

I’m working through the marvelous text and have a massive question.

Why do we use mod n (order of the finite field) and not mod p (the prime in which the field is found) when verifying ECDSA signatures?

If you know the answer, or you have questions of your own, let’s put our minds together and help each other out!