MASTERING-BITCOIN

The Unbreakable Math Behind Bitcoin

IKey Formulas Reference

Formula	Name	Meaning
$y^2 = x^3 + 7 \pmod{p}$	secp256k1 curve	Bitcoin's elliptic curve over a finite field
$K = k \cdot G$	Public key from private key	Scalar multiply the generator $G$ by private scalar $k$
$2^{256} \approx 10^{77}$	Private key space size	Comparable to the number of atoms in the observable universe ( $\sim 10^{80}$ )
$P_3 = P_1 + P_2$	Elliptic curve point addition	Line through $P_1, P_2$ hits curve at a third point; reflect across x-axis

IIVisualization 1: The Elliptic Curve Shape

Bitcoin's curve is secp256k1, defined by $y^2 = x^3 + ax + b$ with $a = 0, b = 7$ .

Explore how the curve's shape changes as you vary $a$ and $b$ . Bitcoin's choice of $a=0, b=7$ gives a clean, symmetric shape.

⚙ interactive visualization — coming to this page format soon

Notice: The curve is always symmetric about the x-axis (because of the $y^2$ term). For Bitcoin's choice $a=0, b=7$ , the curve has no "bump" or extra component — it's a single smooth branch going to infinity.

In the real Bitcoin curve, all arithmetic is done modulo a very large prime $p$ . That turns this smooth shape into a scatter of discrete points — but the algebraic rules stay the same.

IIIVisualization 2: Point Addition — The Geometric Rule

On an elliptic curve we define a special "addition" of points:

Draw a straight line through two points $P_1$ and $P_2$ .
The line hits the curve at exactly one more point (shown as ×).
Reflect that third point across the x-axis — that's $P_1 + P_2$ .

Use the sliders to choose the x-coordinates of $P_1$ and $P_2$ (both on the upper branch), and watch the addition happen.

⚙ interactive visualization — coming to this page format soon

Reflect: The orange × is where the line hits the curve a third time. The purple dot (the sum) is that third point reflected across the x-axis.

Repeating this rule — adding $G$ to itself over and over — is how we get $2G, 3G, \ldots, kG$ . For a 256-bit $k$ , naively doing $k$ additions is impossible, but double-and-add lets us compute $kG$ in about 256 doubling steps. That's why signing is fast.

IVVisualization 3: How Big Is $2^{256}$ ?

A Bitcoin private key is a random 256-bit number. That means it's one of $2^{256} \approx 10^{77}$ possible values.

Slide the key size and compare the resulting key-space against familiar astronomical quantities (shown on a logarithmic scale).

⚙ interactive visualization — coming to this page format soon

Notice: At 256 bits, the key space ( $\approx 10^{77}$ ) is within a few orders of magnitude of the total number of atoms in the observable universe ( $\approx 10^{80}$ ). This isn't a computing problem — it's a physics problem. No amount of hardware can brute-force this.

VQuiz Questions

Question 1

A common misconception is that Bitcoin encrypts transactions to keep them private. What does Bitcoin actually do?

✅ Correct! Bitcoin uses signatures, not encryption. Transactions are public; what's proven is authorship.

❌ Not quite. Every Bitcoin transaction is fully visible on the public ledger — nothing is encrypted. What matters is who authored it.

Show solution

Solution:

Bitcoin transactions are fully public — amounts, sender addresses, and receiver addresses are all visible on the blockchain. Bitcoin does not encrypt them.

What Bitcoin uses is a digital signature: Alice signs the transaction with her private key, and anyone can verify — using her public key — that the signature is valid.

Encryption hides information.
Signatures prove authorship.

Bitcoin needs the second, not the first. That's precisely why the network can be simultaneously open (everyone sees everything) and secure (only the key-owner can spend).

Question 2

A Bitcoin private key is a random 256-bit number. Approximately how many possible private keys exist?

✅ Correct! $2^{256} \approx 10^{77}$ , putting it within a few orders of magnitude of every atom in the observable universe.

❌ Not quite. Remember: 256 bits means $2^{256}$ possibilities. Convert via $\log_{10}(2) \approx 0.301$ .

Show solution

Solution:

A 256-bit key means 256 binary digits, each independently 0 or 1. The total count of possibilities is:

$2^{256} \approx 1.16 \times 10^{77}$

Converting powers of 2 to powers of 10: $\log_{10}(2^{256}) = 256 \cdot \log_{10}(2) \approx 256 \cdot 0.301 \approx 77.1$

For comparison, the observable universe contains roughly $10^{80}$ atoms — just a few orders of magnitude larger. This is why brute-forcing is physically impossible.

❌ $10^{256}$ : a common mistake — this would be if each digit had 10 options, not 2.
❌ $256$ itself is just the number of bits, not the number of keys.
❌ $10^{18}$ is only about $2^{60}$ — that's how big a typical password-strength space is, nowhere near a 256-bit key.

Question 3

Bitcoin's public key is computed as $K = k \cdot G$ , where $k$ is the private scalar and $G$ is the fixed generator point. Which direction of this equation is hard (the trap-door), and why?

✅ Correct! Forward ( $k \to K$ ) takes milliseconds. Reverse ( $K \to k$ ) is the ECDLP — no known shortcut.

❌ Not quite. Think about the 'trap-door' idea: one direction must be easy (signing), the other must be impossible (stealing the key).

Show solution

Solution:

The forward direction $k \to K = k \cdot G$ is fast thanks to the double-and-add algorithm, which computes $kG$ in roughly 256 point-doublings — milliseconds on any laptop.

The reverse direction — recovering $k$ from $K$ — is the Elliptic Curve Discrete Logarithm Problem (ECDLP). No algorithm is known that solves it faster than brute force. This asymmetry is the trap-door:

$\underbrace{k \xrightarrow{\text{easy}} K}_{\text{milliseconds}} \qquad \underbrace{K \xrightarrow{\text{infeasible}} k}_{\text{ECDLP — no known shortcut}}$

This is what lets Alice publish her public key to the whole world. Anyone can verify it came from some private key, but nobody can figure out which one.

Question 4

True or False: For Alice to send a valid, verifiable transaction to Bob, she must transmit her private key to the Bitcoin network so nodes can check her identity.

✅ Correct! The private key never leaves Alice's device. Only the signature and public key are broadcast — verification uses only public information.

❌ Not quite. If Alice transmitted her private key, anyone could steal her coins. Signatures are designed so nodes verify using only the public key.

Show solution

Solution: False.

Alice's private key never leaves her device. Here's the actual flow:

Alice uses her private key $k$ to produce a signature over the transaction data.
She broadcasts only the transaction + signature (and her public key $K$ ).
Every node verifies the signature using the public key $K$ — no private key required.

If she ever transmitted her private key, anyone intercepting it could steal all her coins. The whole point of public-key cryptography is that verification uses only the public half.

This same principle secures TLS (HTTPS), SSH logins, and encrypted messaging.

Solved: 0 / 4

The Unbreakable Math Behind Bitcoin

IKey Formulas Reference

IIVisualization 1: The Elliptic Curve Shape

IIIVisualization 2: Point Addition — The Geometric Rule

IVVisualization 3: How Big Is 22562^{256}2256?

VQuiz Questions

IVVisualization 3: How Big Is $2^{256}$ ?