π Magic Internet Math Episode 4: Why the Inverse Problem Works
Bitcoin's security rests on the inverse problem β but why does an inverse even EXIST?
This isn't "the math is hard." This is PROOF that every non-zero element in a finite field π½β has a multiplicative inverse.
We cover:
Euclidean Algorithm (computing inverses)
Fermat's Little Theorem (a^(p-1) β‘ 1 mod p)
Why secp256k1 uses a prime field
Group & field axioms (closure, identity, inverse)
LibSecP implementation
92 minutes with
@Rob Hamilton π Study guide: ecc-study-guide.magicinternetmath.com/guide.pdf
π§ Listen: fountain.fm/show/2gdYQCIV0eZEuYOW3nGJ
Bitcoin isn't probably secure. It's PROVABLY secure.
β‘ Value-enabled.