Finite Field

A finite field, also called a Galois field, is a number system containing a finite number of elements in which addition, subtraction, multiplication, and division (except by zero) are all defined and stay inside the set. Elliptic-curve cryptography does not operate over the infinite real numbers; it operates over a finite field, which is what makes the math exact, repeatable, and free of rounding error across every machine in the network.

Prime fields and modular arithmetic

The simplest finite fields are prime fields, written GF(p) or F_p, whose elements are the integers {0, 1, 2, …, p−1} for a prime p. All operations are performed using modular arithmetic, reducing every result modulo p. Because p is prime, every non-zero element has a multiplicative inverse, so division is always well-defined. The secp256k1 curve lives over the prime field with p = 2²⁵⁶ − 2³² − 977, a roughly 256-bit prime.

Why the order is a prime power

A finite field of order q exists if and only if q is a prime power pᵏ. This follows from the field's structure as a vector space over its prime subfield, which forces the element count to be a power of a single prime. Bitcoin uses the simplest case, k = 1, so its curve coordinates are plain integers reduced modulo a single large prime.

Finite-field arithmetic is the layer beneath every curve operation: point coordinates are field elements, and combining points reduces to field additions, multiplications, and inversions. It feeds directly into elliptic curve cryptography.