
Sign up to save your podcasts
Or


In this episode, we picked back up on our red-team tour of Bitcoin cryptography and tried to make sense of the last few weeks of fast-moving math news. We unpacked why the recent excitement around the exponential time hypothesis mattered, how it relates to the discrete log problem behind Bitcoin’s elliptic curve cryptography, and why “less exponential” is not the same thing as “Bitcoin is broken.” Along the way, we revisited the different doors an attacker would have to walk through to weaken secp256k1, from generic algorithmic improvements to curve symmetries, lifting tricks, and the bigger backstop of P vs NP. The goal wasn’t to declare victory or panic, but to get clearer on what has actually changed, what remains theoretical, and where AI seems to fit as a theorem-grinder rather than a magic cryptography-breaking button.
We also spent time on the emerging tooling around formal verification and hash-based signatures. That took us into sig.golf, Lean proofs, OpenAI’s public math repository, and the growing idea that part of Bitcoin’s future safety may depend not just on us verifying systems, but on us proving that machines can verify them too. We talked through why libsecp256k1 deserves far more appreciation, why Jonas Nick’s post-quantum work keeps showing up at the center of these conversations, and why experiments around Lean, Bitcoin consensus rules, and AI-assisted proof generation feel increasingly important. If this show is our attempt to build a bridge into the math, this was one of those episodes where the bridge got a little longer — and a lot more interesting.
OpenAI just dropped roughly 300 math papers with Lean proofs, mathematicians are crashing out, and the vague-posting has started: "math is breaking, so cryptography is next." Brian and Rob Hamilton refuse to hand-wave. Rob fed the Magic Internet Math elliptic-curve study guide and the open theorems into a model and asked it straight: if you wanted to break Bitcoin's curve, which doors would you knock on? Then he and Brian walk through every one of them, live.
The result is a red-team tour of secp256k1. There are six offensive open problems and three defenses nobody has been able to prove, and each comes with the specific math that would have to break. Along the way: what Lean proofs actually are, why the discrete log problem is where the hardness lives, why "elliptic curve cryptography has been broken" will probably be a headline about some curve Bitcoin doesn't use, and why Big Bitcoin and Big Math are on a collision course.
In this episode:
• OpenAI's ~300-paper drop, the "11 squares" packing result everyone memed, and the human who immediately found the beautiful version nobody paid for
• Lean explained: an audit trail for what the AI did, built up from the foundations of math
• Why mathematicians are upset (the funding model behind long-standing problems), and Terence Tao's case that humans still matter
• Division of labor between people and machines, and Brian's advice to his daughter Kayla, a senior math major: apprentice on Lean now, then go do your research
• Big-O notation in two minutes, and why it's the first page of Neal Koblitz's number theory and cryptography book
• The matrix-multiplication race (Strassen's ~2.8 down to ~2.37 and below) and why faster linear algebra is the real prize for AI
• secp256k1 from first principles: y² = x³ + 7 over a finite field, point addition, and why public → private is a one-way street
• Pollard's rho and the real defense line of 2¹²⁸, plus the Coldcard reminder: 2³² falls to one computer and ~2⁷⁰ still costs real money
• Door 1: point factoring
• Door 2: the "minors" attack. Build a big matrix and hunt for a vanishing determinant. Solved toy curves at 2⁵⁰, but an Aug 2026 follow-up showed it costs more than brute force at scale
• Door 3: beating the generic √n bound (Shoup)
• Door 4: the Koblitz-curve symmetry Satoshi chose for speed, and a 2026 Lean result that found only the trivial symmetry survives
• Door 5: lifting the problem to a smooth curve, and why the height penalty blows up
• Door 6: isogenies and the "weak cousin" curve, why GRH says every door in the family is equally strong, and why this is a combo pool shot rather than a break
• The defenses no one can climb: one-way functions, proving the discrete log is hard, and P vs NP
• Yehuda Lindell's (Coinbase) thread: AI proving hard theorems is no evidence that elliptic curve hardness is in danger
• Shor's algorithm as an engineering and physics problem, not a math one, and the post-quantum camps (hash-based, lattices, isogenies)
• A preview of the math panel at BTC Amsterdam: "do a podcast to get inspiration for the conference talk"
️ Brian Hirschfield × Rob Hamilton
Magic Internet Math: a first-principles podcast about mathematics, Bitcoin, and meaning
⚡ Follow:
Brian on X: https://x.com/Fundamentals21m
Rob Hamilton on X: https://x.com/Rob1Ham
AnchorWatch: https://anchorwatch.com
Magic Internet Math: https://magicinternetmath.com
Further reading:
secp256k1: Security Status & Open Problems (episode companion): https://bitdevs.magicinternetmath.com/content/secp256k1-open-problems
OpenAI math results (Lean): https://github.com/openai/math
#Bitcoin #EllipticCurves #secp256k1 #Cryptography #DiscreteLog #Lean #FormalProofs #OpenAI #PvsNP #PostQuantum #MagicInternetMath #Mathematics #RobHamilton
We’re back because math keeps refusing to stay in the classroom. In this episode, I unpack two very different kinds of “math pop culture.” First, we revisit entropy, seed generation, and wallet security through a Bitcoin lens: dice rolls versus machine randomness, Bitkey’s firmware checks, Bitcoin Core as the most-reviewed software stack in the room, and why truly understanding how keys are made matters more than blindly outsourcing trust. The deeper theme running through that whole section is validation—how much of security is really just getting honest about what you can and cannot verify for yourself.
From there, we turn to two recent rage-bait flashpoints: the anti-algebra Tucker Carlson clip and the hype around AI “solving” Navier-Stokes. I argue that abstraction is the toolkit that lets you reason your way out of the matrix, and that dismissing algebra as fake misses the entire point of mathematical thinking. On the AI side, we get into proof formalization, peer review, incentive problems in mathematics, and whether machine-generated breakthroughs actually advance math—or mostly advance our need for better audit trails. We close on a more optimistic note: AI may compress old workflows, but it also increases the value of high-agency humans who can validate, reason, and build beyond the rails.
Magic Internet Math is back. After the summer that set the Bitcoin world on fire — the Cold Card entropy disaster — Brian and Rob Hamilton (AnchorWatch) reunite for a two-hour deep dive on the event Rob spent three sleepless weeks at the center of, and what it taught them about AI, entropy, censorship, and self-custody.
The spine of it: when funds started moving off Cold Cards, Rob loaded the firmware into the LLMs. Claude and Codex hedged and downgraded; Kimi K3 — a Chinese open-weight model — instantly printed the vulnerability. That contrast becomes the episode's thesis: the machines see more than they let on, and the open models will say what the censored ones won't. From there it opens into the math of entropy (why you roll your own dice), a love letter to libsecp256k1, and why sovereignty requires actually knowing the math — because they can censor the models, but they can't ban the math.
In this episode:
• The Cold Card entropy disaster — MK3 (~20–32 bits) vs MK4 (~70 bits), "cannon fodder for the next wave," and Rob's pinned-tweet triage guide for single-sig and multisig holders
• Using LLMs to find the vulnerability — Claude and Codex censored and hedging, Kimi K3 printing it instantly: "the machine sees more than it lets on"
• Open-weight Chinese models as the workhorse — LLMs as "slot machines" that spit out vulnerabilities; 100 scans at $100 beating one $10k elite scan
• Why you roll your own dice: y² = x³ + 7, 2²⁵⁶ points, equal probability, and XOR (addition mod 2) to combine entropy the machine can't fake
• "Cryptography is a weapon; entropy is the bullet" — brain wallets, hash functions, and why crypto books assume good entropy
• Bitcoin Core's four entropy sources, Alex Waltz's call-trace deep dive, ralo mcfluid, and why "Satoshi's keys are the AD-IQ proof" the RNG is sound
• Custody done right — River and owning your stack, Prime Trust, "only the paranoid survive," and "the soundest sleepers are the first to get wrecked"
• FROST and Frostsnap (Lloyd & Nick), nonces, and the two places you actually need randomness
• Agent-orchestration reality — lazy downstream agents, "any ambiguity in delegation will be used against you," front-loading the architecture, and interviewing the CTO to grill yourself on the gaps
• AI-psychosis jokes, wellness checks, and why knowing the math keeps you from anthropomorphizing the machine
• A love letter to libsecp256k1 — the red team dog-piled it and found nothing but doc nits; "if you've contributed to libsecp, you never buy a beer at a conference again"
• Rob's first Bitcoin Core and Knots contributions (fail-open commit-verification bugs), OpenSats funding the red-team tooling, and a shout-out to Lawrence, the #5 Core contributor
• The fork drama, the right to exit, Byzantine generals, and the "whale fall" of Blake-algorithm altcoin miners descending on the new chain
• Why sovereignty requires the math — "you can't be a sovereign individual if you don't understand enough" — and going to the Bitcoin store to find the manager who doesn't exist
️ Brian Hirschfield × Rob Hamilton
Magic Internet Math — a first-principles podcast about mathematics, Bitcoin, and meaning
⚡ Follow:
Brian on X: https://x.com/Fundamentals21m
Rob Hamilton on X: https://x.com/Rob1Ham
AnchorWatch: https://anchorwatch.com
Magic Internet Math: https://magicinternetmath.com
#Bitcoin #Cryptography #Entropy #ColdCard #AI #OpenWeights #KimiK3 #secp256k1 #SelfCustody #MagicInternetMath #Mathematics #RobHamilton #AnchorWatch
In this episode, Rob and I sit down with Brandon Black (aka Rearden Code) for a deep dive into the quantum-computing debate around Bitcoin. We unpack why Brandon thinks the more useful framing is not “post-quantum” but “post-secp256k1,” and why Bitcoiners should care less about sci-fi narratives and more about understanding the actual cryptographic assumptions that protect coins today. Along the way, we revisit the now-legendary conference panel on quantum risk, talk through exposed pubkeys, xpub leakage, multisig, Taproot, Lightning force closes, and the difference between a theoretical break and an economically viable attack.
We also spend a lot of time sizing risk correctly. Brandon helps us separate slow, visible cryptographic degradation from the far less likely “everything breaks tomorrow” scenario, and we explore how incentives change depending on whether the attacker wants profit, strategic advantage, or chaos. The conversation eventually zooms all the way out to math, physics, and engineering: Shor’s algorithm may exist on paper, but building a machine that can actually matter for Bitcoin is still a very different question. If you want a rigorous, grounded conversation about quantum threats, elliptic curves, MuSig2, FROST, and how to think clearly instead of panicking, this is a great one.
The legendary panel: https://www.youtube.com/watch?v=wbJkODcrz7Q
We celebrated June 28 as “Perfect Number Day” and finally told one of my favorite origin stories behind this whole project: a late-night drive home from a Phish show with Kayla, where a quick conversation about why 6 and 28 are perfect numbers turned into a full-blown family math obsession. We revisited how that curiosity led us to trial-and-error the next perfect number, fire up a Raspberry Pi, write Python code, hit the limits of the machine, and eventually discover just how deep number theory goes—from the Pythagoreans to Euclid, Mersenne primes, and the still-open questions around perfect numbers.
From there, we closed out our elliptic curve study guide by turning to Schnorr signatures, Taproot, MuSig, FROST, libsecp256k1, and the practical realities of Bitcoin development. We talked through why Schnorr is cleaner than ECDSA, how signature aggregation improves privacy and scalability, why wrench-attack resistance matters, and why the ecosystem around libsecp256k1 deserves far more attention. We also reflected on the tiny, careful pace of high-stakes Bitcoin cryptography work, the importance of maintainers like Jonas Nick, Pieter Wuille, Tim Ruffing, and Andrew Poelstra, and why understanding these mathematical foundations is the whole point of Magic Internet Math.
In this Father’s Day episode of Magic Internet Math, I welcomed my daughter Kayla to the mic for her first appearance on the show. We started with her recent work explaining group theory in just three minutes, then used that as a jumping-off point to talk about why ideas like groups, inverses, isomorphisms, elliptic curves, and point addition matter so much in Bitcoin and cryptography. We also got honest about the difference between intuition and rigor: I’ve spent a lot of time building conceptual bridges for this audience, while Kayla is bringing the mathematician’s instinct to stop, verify the ground beneath her feet, and ask what has actually been proved.
From there, we traced the path that led her into math in the first place, from early logic puzzles and Waldorf-school mental math to an unusually rich high-school calculus experience, AP Calc BC, Penn State, linear algebra, analysis, and her current summer research in number theory. Along the way, we talked about why good teachers matter, why “math person” does not mean “numbers person,” how linear algebra suddenly makes everything click, and why Gauss keeps showing up everywhere once you start taking mathematics seriously.
Rob and Brian shake off the dust after a busy stretch of conferences and a milestone YouTube debut with guest Alan, then map the road from elliptic curves to an upcoming mini‑series on hash functions. We talk Prague plans (a keynote on “the mathematical layer of sovereignty” and a quantum‑security panel with Trezor), growing Miniscript adoption (Liana, Trezor), and why the Magic Internet Math platform now extends into local community with a new math‑forward BitDevs in Philadelphia. Along the way we reflect on conferences as cultural glue and classrooms for Bitcoiners. The back half is a detour into poker as a living analogy for Bitcoin: bankroll management, game selection, Kelly criterion, and conviction under volatility. We kick around time‑preference versus risk‑preference, the perils of leverage, and treasury/custody tradeoffs—from digital credit notes and proof‑of‑reserves to insurance‑backed multisig. Expect practical takes on River’s yield accounts, ETF custody signals (Bitwise/Coinbase), and why resilient operations matter more than narratives—plus a few fun asides from WSOP lore to Rounders and the Potoshi pattern.
In this first-ever guest episode of Magic Internet Math, Rob Hamilton and I (Brian Hirschfield) welcome author and thinker Allen Farrington for an unfiltered tour through math as a liberal art, why rigor matters more than vibes, and how curiosity—not applications—often drives real progress. We trade stories about learning (and unlearning) math, from the lore of the irrationality of √2 and CP Snow’s Two Cultures, to Paul Lockhart’s Mathematician’s Lament, Joel David Hamkins’ philosophy of mathematics, and the perennial tug-of-war between pure and applied work. We also dig into education: what good teaching feels like, why boredom or excessive difficulty turn students off, and how letting people “cook” can build conviction and genuine understanding.
From elliptic curves to hash functions, we connect math to Bitcoin without turning into “I f’ing love science” cosplay. Allen throws down a challenge on explaining why hash functions have the properties we rely on (beyond just how they’re built or what they do), teeing up our next series. Along the way we touch cryptography culture, modular arithmetic, the modularity theorem vs. Fermat’s Last Theorem credit, and how AI tools help—and fail—when you push past the training data. Come for the banter; stay for the foundations, the philosophy, and the mission to create shareholder value by going pointlessly deep in order to build practical tools later.
From the publisher's feed