Magic Internet Math

• Hell Money: https://hell.money/
• libsecp256k1: https://github.com/bitcoin-core/secp256k1
• Miniscript: https://miniscript.org/
• Bitcoin Amsterdam: https://www.bitcoin.amsterdam/
• Lugano Plan ₿ Forum: https://planb.lugano.ch/planb-forum/
• Midwest Bitcoin Summit: https://midwestbtc.com/media
• Bitcoin Policy Institute: https://www.btcpolicy.org/
• Bitcoin Policy Summit: https://www.btcpolicysummit.org/
• Motivate the Math: https://podcasts.apple.com/us/podcast/motivate-the-math/id1790329241
• Lewis Carroll Society of North America: https://www.lewiscarroll.org/
• Alice's Adventures in Wonderland: https://www.simonandschuster.com/books/Alices-Adventures-in-Wonderland/Lewis-Carroll/Alices-Adventures-in-Wonderland/9781665925778
• Phil Spector: https://philspector.com/

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.

• AnchorWatch: https://www.anchorwatch.com/
• Presidio Bitcoin: https://www.presidiobitcoin.org/
• Block: https://block.xyz/
• Bitkey: https://bitkey.world/
• Bitkey Wallet GitHub: https://github.com/Bitkey-Wallet/
• Bitcoin Core: https://bitcoincore.org/
• libsecp256k1 GitHub: https://github.com/bitcoin-core/secp256k1
• BitDevs: https://bitdevs.org/
• OpenAI Navier–Stokes announcement: https://openai.com/index/navier-stokes-solution/
• Clay Mathematics Institute: https://www.claymath.org/
• Algebraic Number Theory and Fermat’s Last Theorem: https://www.routledge.com/Algebraic-Number-Theory-and-Fermats-Last-Theorem/Stewart-Tall/p/book/9781032610931
• Hell Money podcast: https://play.fountain.fm/show/W8pjfavWchv8diXjikgC
• Wavlake: https://wavlake.com/
• Sir Andrew Wiles: https://www.maths.ox.ac.uk/people/andrew.wiles
• Open Ordinals: https://ordinals.org/
• Casey Rodarmor’s blog: https://rodarmor.com/blog/

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

• Magic Internet Math: https://magicinternetmath.com/
• Brandon Black speaker profile: https://sv23.adoptingbitcoin.org/speakers/brandonblack/
• James O'Beirne: https://jameso.be/
• BIP 360: https://github.com/bitcoin/bips/blob/master/bip-0360.mediawiki
• BIP 327 (MuSig2): https://github.com/bitcoin/bips/blob/master/bip-0327.mediawiki
• BIP 340 (Schnorr Signatures for secp256k1): https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki
• BIP 341 (Taproot): https://github.com/bitcoin/bips/blob/master/bip-0341.mediawiki
• BIP 32 (Hierarchical Deterministic Wallets): https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki
• BIP 39 (Mnemonic code for generating deterministic keys): https://github.com/bitcoin/bips/blob/master/bip-0039.mediawiki
• FROST Protocol (RFC 9591): https://www.rfc-editor.org/rfc/rfc9591.html

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.

• Magic Internet Math: https://magicinternetmath.com/
• Magic Internet Math Podcast: https://podcasts.apple.com/us/podcast/magic-internet-math/id1868224151
• Phish Tour Archives: https://phish.com/tour-archives/
• BIP 340 — Schnorr Signatures for secp256k1: https://bips.dev/340/
• BIP 341 — Taproot: SegWit version 1 spending rules: https://bips.dev/341/
• BIP 342 — Validation of Taproot Scripts: https://bips.dev/342/
• BIP 327 — MuSig2 for BIP340-compatible Multi-Signatures: https://bips.dev/327/
• RFC 6979 — Deterministic Usage of DSA and ECDSA: https://www.rfc-editor.org/info/rfc6979/
• RFC 9591 — FROST Threshold Schnorr Signatures: https://www.rfc-editor.org/info/rfc9591/
• libsecp256k1: https://github.com/bitcoin-core/secp256k1
• rust-bitcoin: https://rust-bitcoin.org/
• AnchorWatch: https://www.anchorwatch.com/
• Blockstream: https://blockstream.com/
• Blockstream Research: https://research.blockstream.com/
• Jonas Nick: https://blog.blockstream.com/author/jonas/
• Andrew Poelstra and the Blockstream Research team: https://blog.blockstream.com/blockstream-research-the-focus/
• Pieter Wuille (sipa): https://github.com/sipa
• Daniel Shanks — Solved and Unsolved Problems in Number Theory: https://bookstore.ams.org/chel-297/
• SHAttered (the SHA-1 collision project): https://shattered.io/sha1-collision/

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.

• Magic Internet Math: https://magicinternetmath.com/
• BTC Prague: https://btcprague.com/
• Programming Bitcoin by Jimmy Song: https://jimmysong.org/books/programming-bitcoin/
• Understanding Cryptography by Christof Paar and Jan Pelzl: https://link.springer.com/book/10.1007/978-3-642-04101-3
• Benedict Gross (Harvard profile): https://people.math.harvard.edu/~gross/
• Harvard Math E-222 Abstract Algebra archive: https://legacy-www.math.harvard.edu/archive/122_fall_03/index.html
• Linear Algebra Done Right by Sheldon Axler: https://linear.axler.net/index.html
• Penn State Department of Mathematics: https://science.psu.edu/math
• Waldorf Education (AWSNA): https://www.waldorfeducation.org/

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.

• 'AnchorWatch': https://www.anchorwatch.com
• 'Miniscript (reference implementation by sipa)': https://github.com/sipa/miniscript
• 'Liana wallet (WizardSardine)': https://wizardsardine.com/liana/
• 'WizardSardine': https://wizardsardine.com
• 'Pay to Script Hash (P2SH) – Bitcoin Wiki': https://en.bitcoin.it/wiki/Pay_to_script_hash
• 'Pay to Witness PubKey Hash (P2WPKH) – Bitcoin Wiki': https://en.bitcoin.it/wiki/Pay_to_witness_public_key_hash
• 'NYC BitDevs': https://bitdevs.org/nyc
• 'BTC Prague': https://www.btcprague.com
• 'Zeus Wallet': https://zeusln.com
• 'River': https://river.com
• 'River Transparency / Proof‑of‑Reserves': https://river.com/transparency/
• 'Kelly Criterion – Wikipedia': https://en.wikipedia.org/wiki/Kelly_criterion
• 'Factorial (52! for deck permutations) – Wikipedia': https://en.wikipedia.org/wiki/Factorial
• 'World Series of Poker (WSOP)': https://www.wsop.com
• 'Binion’s Gambling Hall (WSOP origins)': https://www.binions.com
• 'Rounders (1998) – IMDb': https://www.imdb.com/title/tt0128442/
• 'Arkham Intelligence': https://arkhamintelligence.com
• 'Holt’s Cigar Company (Philadelphia)': https://www.holts.com

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.

• 'Allen Farrington – Bitcoin is Venice': https://bitcoinisvenice.com/
• 'AnchorWatch (company)': https://anchorwatch.com/
• 'Joel David Hamkins – personal site': https://jdh.hamkins.org/
• 'Lectures on the Philosophy of Mathematics (Joel David Hamkins)': https://jdh.hamkins.org/lectures-on-the-philosophy-of-mathematics/
• 'Lex Fridman Podcast – Joel David Hamkins episode (show hub)': https://lexfridman.com/podcast/
• 'C. P. Snow – The Two Cultures (overview)': https://en.wikipedia.org/wiki/The_Two_Cultures
• 'Paul Lockhart – A Mathematician’s Lament (book page)': https://blpress.org/books/a-mathematicians-lament/
• 'The Cult of Statistical Significance (Ziliak & McCloskey) – publisher page': https://press.umich.edu/Books/T/The-Cult-of-Statistical-Significance2
• 'Learn Me A Bitcoin (educational site)': https://learnmeabitcoin.com/
• 'NIST FIPS 180-4 – Secure Hash Standard (SHA-256 etc.)': https://csrc.nist.gov/publications/detail/fips/180/4/final
• 'RFC 1321 – The MD5 Message-Digest Algorithm': https://www.rfc-editor.org/rfc/rfc1321
• 'NIST guidance on SHA-1 (project page)': https://csrc.nist.gov/projects/hash-functions/sha-1
• 'Andrew Poelstra – Blockstream profile': https://blockstream.com/team/andrew-poelstra/
• 'Jonas Nick – Blockstream profile': https://blockstream.com/team/jonas-nick/
• 'Peter Wuille (sipa) – GitHub': https://github.com/sipa
• 'MathOverflow (research Q&A)': https://mathoverflow.net/
• 'Math Girls (Hiroshi Yuki) – publisher page': https://bentobooks.com/math-girls/
• 'Range (David Epstein) – publisher page': https://www.penguinrandomhouse.com/books/557690/range-by-david-epstein/

• 'Magic Internet Math (site)': https://magicinternetmath.com/
• 'bitcoin++ (developer conference series)': https://www.btcplusplus.dev/
• 'Hoover Dam (Bureau of Reclamation)': https://www.usbr.gov/lc/hooverdam/aboutus.html
• 'BIP 68: Relative lock-time': https://bips.dev/68/
• 'BitVM whitepaper (Robin Linus)': https://bitvm.org/bitvm.pdf
• 'Binohash: Transaction Introspection Without Softforks (paper)': https://robinlinus.com/binohash.pdf
• 'ZeroSync Association': https://zerosync.org/
• 'StarkWare (STARK-based scaling)': https://starkware.co/
• 'libsecp256k1 (Bitcoin Core library)': https://github.com/bitcoin-core/secp256k1
• 'Codex32 overview (Blockstream/Andrew Poelstra)': https://blog.blockstream.com/codex32-a-shamir-secret-sharing-scheme/
• 'FROST threshold Schnorr (IETF RFC 9591)': https://www.ietf.org/rfc/rfc9591.html
• 'BIP 32: Hierarchical Deterministic Wallets': https://bips.dev/32/
• 'An Introduction to Statistical Learning (ISLR)': https://www.statlearning.com/home
• 'Localhost Research (Bitcoin research org)': https://lclhost.org/
• 'OpenSSL (project site)': https://www.openssl.org/
• 'NIST note on removal of Dual_EC_DRBG': https://www.nist.gov/news-events/news/2014/04/nist-removes-cryptography-algorithm-random-number-generator-recommendations

In this podcast episode, Brian and Rob from Magic Internet Math discuss verifying Bitcoin, focusing on the underlying math and cryptography to understand the validity of private keys and transactions.

Key Topics:

Summary:

Brian and Rob introduce the topic of mathematically verifying Bitcoin transactions. They discuss how their podcast aims to demystify the math behind Bitcoin, making it accessible to everyone, regardless of their math skills. They pose the question of how many people have truly verified their Bitcoin and invite audience participation to share their verification processes.

Brian shares his personal journey of verifying Bitcoin, starting with reading technical books and exploring the GitHub repository. He recounts his existential crisis upon encountering the complex cryptography of SEC256P1 and his subsequent deep dive into cryptography, which led to the creation of the math podcast. He emphasizes the importance of understanding the math to gain confidence in the validity of one's Bitcoin. Rob explains the scale of possible Bitcoin private keys, stating that there are more possible keys than atoms in the universe and they plan to use the number seven to explain the basic concepts.

They delve into the concept of modular arithmetic, using the number seven as a simplified model to explain how remainders work in cryptographic systems. They illustrate how a times table works in a mod 7 system, where the result is the remainder after dividing by 7. They emphasize the importance of understanding inverses in this system, where multiplying a number by its inverse results in 1. They explain that in Bitcoin, division is performed by multiplying by the inverse.

Brian and Rob highlight that when purchasing Bitcoin, one should question the validity of the private key. They briefly discuss elliptic curve cryptography, explaining that the Bitcoin curve is a series of points, each representing a public-private key pair. The public key is mathematically derived by multiplying the Bitcoin generator point by the private key. They note that it is computationally infeasible to reverse this process and determine the private key from the public key.

They explain that verifying a public key involves confirming that it is a valid point on the elliptic curve. The algebraic structure of the elliptic curve ensures that every point has an inverse, meaning that the private key can be mathematically derived. They also touch upon the significance of the LibSec256K1 library, which is crucial for signature verification and is widely used in the Bitcoin ecosystem.

The conversation shifts to the potential threat of quantum computing to Bitcoin's cryptography. They explain that quantum computers could potentially solve the discrete log problem, which underlies the security of Bitcoin's public-private key system. They acknowledge the concerns surrounding quantum computing but emphasize that it is not an immediate threat due to the limitations of current quantum computers. They mention ongoing research into quantum-resistant cryptographic algorithms that could be implemented in Bitcoin if necessary. They highlight that the easiest targets for quantum attacks are old P2PK addresses and address reuse.

They stress the importance of good entropy in generating private keys, as weak entropy can make keys vulnerable to brute-force attacks. They share that bad randomness is a common way for people to mess up their Bitcoin security. They suggest finding a coin and flipping it to build a sense of probability.