Exponents and Powers

“256-bit security.” “SHA-256.” ” $2^{128}$ possible keys.” ” $x^2 = 25$ .” Every one of those phrases is a power in disguise, and cryptography is saturated with them — not as decoration, but because repeated multiplication is one of the few operations that gets hard to undo fast enough to be useful for security. Before going further into this track, powers need to stop being a vague memory from school and start being something you can read fluently.

What a power actually is

A power is just repeated multiplication, written compactly:

Example

$2^3 = 2 \times 2 \times 2 = 8$

Fig. 1 — the two parts of a power: the base gets multiplied, the exponent says how many times.

The bottom number is the base — the thing being multiplied. The small number sitting above it is the exponent — how many copies of the base get multiplied together. $5^2$ works the same way: $5 \times 5 = 25$ .

Powers on variables

Nothing about this changes when the base is a variable instead of a number:

Example

$x^2 = x \times x \qquad x^3 = x \times x \times x$

If $x = 4$ , then $x^2 = 4 \times 4 = 16$ .

This is the form powers actually take inside a circuit — not a fixed number raised to a fixed power, but a secret value raised to a power, which is exactly what makes the next section interesting.

Why this shows up everywhere

Powers aren’t a cryptography-specific trick — they’re how plain geometry already works: the area of a square is $\text{side}^2$ , the volume of a cube is $\text{side}^3$ . Cryptography just leans on the same idea harder. Take the running example from this track: a secret value $x$ , and a public claim that $x^2 = 25$ .

Checking

$x^2 = 25, \quad x = 5 \implies 5^2 = 5 \times 5 = 25 \quad \checkmark$

A zero-knowledge proof convinces a verifier that some $x$ satisfying this exists, without that $x$ ever appearing in the proof.

That’s the same claim this track keeps returning to, just written with a power instead of a product — proof that the two notations describe exactly the same kind of statement.

Growth that outruns intuition

Powers of two climb a lot faster than they look like they should:

Fig. 2 — four powers of two, each roughly doubling the exponent of the last. The values on the right are what actually matters.

$2^{20}$ already clears a million. $2^{30}$ clears a billion. And cryptography doesn’t stop at 30 — it goes to $2^{128}$ or $2^{256}$ .

A 128-bit key space

$2^{128} \approx 3.4 \times 10^{38}$

Roughly 340 undecillion — a number with no everyday referent, because nothing in ordinary experience is that large.

That number is the entire basis for a phrase like “128-bit security.” It means an attacker guessing blindly has to search, on average, half of $2^{128}$ possibilities before finding the right one — and even running through a trillion guesses a second, that search would still outlast the sun. Pick a big enough exponent, and brute force simply stops being a viable attack. That’s the whole job powers do in cryptography: turning a search problem into one too large for raw computing power to matter.

Three rules worth keeping

A handful of exponent rules come up constantly once polynomials and finite fields enter the picture.

Multiplying, same base

$2^2 \times 2^3 = 2^{2+3} = 2^5 = 32$

Multiplying two powers of the same base adds their exponents.

Dividing, same base

$\frac{2^5}{2^2} = 2^{5-2} = 2^3 = 8$

Dividing subtracts the exponents instead.

A power raised to a power

$(2^3)^2 = 2^{3 \times 2} = 2^6 = 64$

Raising a power to another power multiplies the exponents.

None of these need to be memorized as abstract rules — they fall straight out of what a power already means: a count of repeated multiplications, which is easy to add, subtract, or scale. Number theory, polynomials, and elliptic curves all lean on this same exponent arithmetic, so it’s worth being quick with it before those topics arrive.