Definition
Modular arithmetic is a system in which numbers wrap around upon reaching a fixed value called the modulus, exactly the way a 12-hour clock returns to 1 after 12. Two integers are said to be congruent modulo m when their difference is divisible by m, written a ≡ b (mod m). The expression b mod m denotes the unique remainder r with 0 ≤ r < m. This wrap-around arithmetic is the bedrock beneath every elliptic-curve operation in Bitcoin.
Clock arithmetic, formalized
If it is 9 o'clock and you add 8 hours, the result is 1 o'clock rather than 17, because 17 is congruent to 5 modulo 12. Congruence is compatible with addition, subtraction, and multiplication, which means you can reduce intermediate results at any point without changing the final answer. That property is what keeps 256-bit curve computations from ballooning into unbounded integers.
Prime moduli and inverses
When the modulus p is prime, every non-zero value has a multiplicative inverse, so division becomes possible and the integers modulo p form a finite field. This is precisely the setting elliptic curves require: secp256k1 performs all of its coordinate arithmetic modulo a large prime. Modular reduction also underpins RSA and Diffie–Hellman, and the apparent difficulty of certain modular problems, such as discrete logarithms, is what makes them cryptographically useful.
Grasping modular arithmetic demystifies why curve coordinates never overflow and why the discrete logarithm problem is hard: the answers live in a finite, wrap-around world with no smooth path to invert.
In Simple Terms
Modular arithmetic is a system in which numbers wrap around upon reaching a fixed value called the modulus, exactly the way a 12-hour clock returns…