Discrete Log Problem (DLP)

The discrete log problem, or DLP, is the mathematical puzzle underlying most public key cryptography: given a group element that has been multiplied by itself an unknown number of times, recover that number. On the elliptic curves used by Bitcoin, deriving a private key from its public key would require solving this problem, which is believed to take on the order of 2 to the power of 128 operations.

Why it matters

The entire concept of a bitcoin balance rests on this asymmetry. Generating a public key from a private key takes microseconds, while reversing the computation is infeasible for any known computer. That one-way property lets users publish addresses freely while remaining the only party able to spend, replacing vault doors and signatures with pure mathematics.

The assumption is not eternal. A sufficiently large quantum computer running Shor's algorithm could solve the discrete log problem efficiently, which is why post-quantum cryptography is an active research area for Bitcoin and for the banking system, government communications, and internet security generally, all of which lean on the same or related assumptions.

In the gold vs bitcoin debate

Gold's scarcity is enforced by geology, bitcoin's ownership by the discrete log problem. Skeptics frame this as fragility: a mathematical breakthrough could undermine bitcoin in a way nothing can undermine a metal. Supporters respond that the same break would collapse online banking and military encryption first, and that Bitcoin's rules can migrate to quantum-resistant signatures through a soft fork if the threat materializes.