Phundamentals's avatar
Phundamentals
ph@nostrplebs.com
npub12eml...y99g
Author: Bitcoin for Institutions https://zeuspay.com/btc-for-institutions Co-Host of Rock-Paper-Bitcoin, Motivating the Math, Sound Coffee, and Back on the Chain podcasts Study math, be sovereign
Phundamentals's avatar
Phundamentals 3 hours ago
fountain.fm/episode/Up9C6z… @Rob Hamilton and I continue to discuss the arithmetic basis for understanding Bitcoin's elliptic curve cryptography. This episode can stand alone, but its part 3 We cover the Discrete Log Problem where I explain what discrete means, and what a logarithm is.
People study mathematics to find answers to questions they don’t yet know they have. Studying pure math for its own sake is an investment in your future self. Asking “why do I need this?” is your current self not understanding what your future self needs. Study math - a little bit every day magicinternetmath.com
Since markets opened on the Iran war (3/2): 🟠 Bitcoin: +6.7% 🟡 Gold: -0.4% (gave back its entire spike) 📉 S&P 500: -1.5% 🏦 10Y Bonds: SOLD OFF (+17bps) Gold spiked, then faded. Bonds failed completely. Bitcoin is the only war trade that actually worked. Flight to safety is being redefined in real time. 🦡
Don’t talk to me about spam. Tell me why your scarce time is better spent creating a new problem to solve the old one instead of just building. You can’t do both.
Phundamentals's avatar
Phundamentals 3 weeks ago
The inverse problem in Bitcoin cryptography: Given P = kG (public key = private key × generator point), finding k is the discrete logarithm problem — computationally infeasible. But step back: why does k⁻¹ exist at all? THEOREM: In a finite field 𝔽ₚ where p is prime, every non-zero element a has a multiplicative inverse a⁻¹ such that a × a⁻¹ ≡ 1 (mod p). PROOF: By Fermat's Little Theorem, a^(p-1) ≡ 1 (mod p) for any a ≠ 0. Therefore: a × a^(p-2) ≡ 1 (mod p) So: a⁻¹ = a^(p-2) This is why Bitcoin works. Not luck — mathematical certainty. New episode breaks it down: fountain.fm/show/2gdYQCIV0eZEuYOW3nGJ
Phundamentals's avatar
Phundamentals 3 weeks ago
🔑 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.