Magic Internet Math

Hash Functions, Linear Algebra, and Alice in Wonderland

Magic Internet Math: https://www.magicinternetmath.com/ Shout out to https://x.com/uncleJim21 for the Alice in Wonderland story and the following rebuke of Lewis Carroll: https://www.youtube.com/shorts/33FYXpEWgyA This week we kept it loose but still got our reps in. We talked about why the math side of Bitcoin is starting to matter more in public, from conference panels and keynotes to the kinds of questions people are now asking us directly. We shared updates on upcoming appearances in Lugano, Amsterdam, Prague, and beyond, then dug into the deeper point: when confidence in Bitcoin gets shaken by bugs, headlines, or future quantum fear, the antidote is not vibes or macro slogans — it’s understanding the cryptographic foundations well enough to reason for ourselves. From there, we mapped out where the show is heading next. We reflected on libsecp256k1, Bitcoin Core, Miniscript, and what it means to inspect the basement wiring instead of just admiring the house from the curb. We also previewed future arcs on hash functions, Merkle trees, and linear algebra, including why SHA-256 feels so different from elliptic-curve cryptography. And because this is still Magic Internet Math, we took a wild but fitting detour into Lewis Carroll, imaginary numbers, quaternions, and the stubborn human habit of confusing identity with ideas. 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/

• Transcript
• Chapters

Kayfabe Math is Now Mainstream

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/

• Transcript
• Chapters

Legalize MATH

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

Quantum Computers Don't Exist w/ Brandon Black

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

• Transcript
• Chapters

Perfect Number Day and the Road to Schnorr

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/

• Transcript
• Chapters

My Daughter, the Mathematician (Fathers Day Special)

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/

• Transcript
• Chapters

Risk of Ruin: Bankroll Math for Bitcoiners

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

• Transcript
• Chapters

Allen Farrington

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/

• Transcript
• Chapters

Vegas Recap and Elliptic Curve Point Operations

The Study guide: https://ecc-study-guide.magicinternetmath.com/guide.pdf In this episode, I (Brian) finally introduce myself properly and Rob and I kick off with a Vegas + Bitcoin++ recap before diving back into Chapter 6 of our elliptic curve study guide. We talk small, dev‑focused conferences versus mega‑cons, the Hoover Dam power-plant tour, and the standout conversations around quantum risk, BitVM, and Binohash. We also share plans to bring a math‑track BitDevs to Philly and to run a hands‑on Codex32 workshop soon. Then we slow things down to the math. Using the curve over the reals as a warmup, we revisit the group axioms that make elliptic curves useful for Bitcoin: identity (the point at infinity), inverses (reflect across the x‑axis), closure, and associativity. We sketch point addition and doubling, why doubling accelerates scalar multiplication, and how this geometry-algebra fusion underpins private→public key derivation. Along the way we touch BIP‑68 relative timelocks, why secp256k1’s simple y^2=x^3+7 form is performant, and where post‑quantum work like FROST and research at ZeroSync/Localhost is heading. '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

• Transcript
• Chapters

Live from Bitcoin Park

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: Verification of Bitcoin Elliptic Curve Cryptography Modular Arithmetic Inverse Relationships Quantum Computing and Bitcoin Security Importance of Entropy 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.

• Transcript
• Chapters

Elliptic Curve Cryptography: Discrete Log Problem & Quadratic Residues

The Study guide: https://ecc-study-guide.magicinternetmath.com/guide.pdf In this episode of Magic Internet Math, Rob and Brady discuss the discrete log problem and its importance to Bitcoin's security. Key Topics: Discrete Log Problem Modular Arithmetic Elliptic Curve Cryptography Quantum Computing Bitcoin Transactions Summary: Rob and Brady revisit the math study guide, now nearing its end. They reflect on their journey through modular arithmetic, inverses, and groups, emphasizing their importance in understanding elliptic curve cryptography. They highlight that a deep understanding of group structures is essential to ensure the validity of point manipulations on the curve, which cannot be brute-forced. They stress the need to understand the underlying math to defend against potential attacks that exploit a lack of knowledge in this area. The pair dive into the discrete log problem (DLP), calling it the "big boss" of arithmetic and a crucial element in Bitcoin's security. They note its relevance in the context of quantum computing threats. They explain that the DLP relies on the asymmetry between easily calculating a public key from a private key and the computational infeasibility of reversing the process. It's also described as a form of digital physics, requiring immense computational force to "open the door" and reverse engineer the private key from the public key. The computational cost of solving the DLP is measured using Big O notation, with algorithms like Shanks and Pollard's row reducing the complexity to O(√N), still a significant hurdle. The hosts use a small modular arithmetic example to illustrate the DLP, emphasizing the difficulty of guessing the power needed to reach a specific point on the elliptic curve. They stress the importance of understanding logarithms, describing them as simply powers. They use the mnemonic PEMDAS to explain the order of operations, highlighting the inverse relationship between exponentiation and logarithms. The discussion transitions to the "discrete" aspect of the discrete log problem, explaining that it implies a lack of continuity, making it impossible to infer proximity to the solution. This contrasts with Bitcoin mining, where there are multiple valid solutions. The discrete nature of the DLP forces trial-and-error approaches, making it computationally hard and ugly on purpose. They mention that the best algorithms currently can only reduce the search space to the square root of N.

• Transcript
• Chapters

Brian Solo - Shilling the Math Academy

In this solo episode of the Magic Internet Math podcast, the host discusses the current status of the Magic Internet Math website, his personal journey into math education, and his vision for teaching math as a liberal art. Key Topics: Magic Internet Math website status Personal journey into mathematics Teaching math as a liberal art Subscriber benefits and future plans for the website Rudolf Steiner's influence Summary: The host begins by addressing his tendency to avoid promoting the Magic Internet Math website, which he has been developing for the past three months. The site currently offers a hundred free courses, games, and YouTube series, covering a wide range of subjects, including math, economics, philosophy, and literature. The courses are based on books that mean a lot to him, covering topics from calculus to abstract algebra, with a focus on making these subjects accessible to a broader audience. The host shares his personal journey into mathematics, driven by dissatisfaction with his initial career as an actuary. He transitioned into quantitative strategy and dedicated himself to studying advanced mathematics, often facing challenges in finding suitable textbooks. He recalls his experiences at university bookstores and the early days of MIT OpenCourseware, which significantly aided his learning. Discovering Bitcoin reignited his passion for math, leading him to delve into cryptography and abstract algebra. This journey motivated him to explore different abstract algebra books and eventually incorporate this knowledge into teaching, especially after his daughter became a math major. His disappointment with people's attitudes toward math, viewing it as a means to an end rather than an enriching subject, propelled him to think deeply about how to teach math effectively. He was influenced by the Waldorf school system and Rudolf Steiner's teachings, which emphasize a holistic approach to education. This philosophy has inspired the creation of unique content on the website, blending math with liberal arts, and offering a different perspective on how math is taught and understood. The host also discusses the subscriber benefits of the Magic Internet Math website, priced at $5 a month or $50 a year, with a limited number of lifetime subscriptions available for those closely connected to him. The subscription model aims to support the site's maintenance and development, including hiring a dedicated developer. Subscriber-only content includes a basic high school algebra class, framed as a Greek heroic epic, and a study guide called "The Four Proofs," which explores the different approaches to mathematical proofs by Euclid, Gauss, Steiner, and Satoshi. Looking forward, the host plans to create more original content that combines various topics and ideas, grounded in the philosophy of Steiner and focused on how we know what we know. He envisions lectures and classes that delve deeper into these concepts, accessible to subscribers and lifetime members. He emphasizes that supporting the website is about supporting a different approach to math education and ensuring its continued existence for future learners. The host concludes by saying that he's not asking for charity and truly believes the website provides value for anyone interested in mathematics.

• Transcript
• Chapters

Elliptic Curve Cryptography: Inverses and Group Structure

The Study guide: https://ecc-study-guide.magicinternetmath.com/guide.pdf In this episode of the Magic Internet Math Podcast, the hosts continue their exploration of elliptic curve cryptography, focusing on the inverse problem and the mathematical structures that ensure its existence, as part of their series on Bitcoin security. Key Topics: Inverse Problem Modular Arithmetic Groups and Fields Euclidean Algorithm Fermat's Little Theorem LibSecP Library Summary: The hosts emphasize the importance of understanding the mathematical foundations of Bitcoin, specifically the inverse problem, where a public key can be inverted back into its corresponding private key. They highlight that the existence of an inverse is crucial for the security of Bitcoin, ensuring that transactions can be verified and private keys remain secure. This is supported by the mathematical structures of groups and fields, which guarantee the existence of an inverse for every element under certain operations.

• Transcript
• Chapters

Elliptic Curve Cryptography: A Self-Study Guide

The Study guide: https://ecc-study-guide.magicinternetmath.com/guide.pdf In this episode of Magic Internet Math, Rob and Fundamentals discuss the math behind Bitcoin's security, exploring elliptic curve cryptography, modulo arithmetic, and digital signatures. Key Topics: Seed-Phrase Generation Elliptic Curve Cryptography Modulo Arithmetic Securing Bitcoin with Math The Importance of Primes Understanding Finite Fields LibSecP and Its Significance Quantum Computing Deterministic Nonces Summary: The conversation begins with an overview of how Bitcoin secures money, moving from helpful abstractions like seed phrases to the foundational math involving finite fields and elliptic curves. They discuss how a 12 or 24-word seed phrase is a BIP39 way of generating a BIP32 extended private key, which is essentially a map to the elliptic curve Bitcoin operates on. At its core, you need entropy, a random element, to generate these keys. The hosts emphasize the importance of randomness in key generation and the mathematical assurance that keys are safe from accidental or intentional collisions. They caution against trusting human intuition for randomness, advocating for methods like dice rolls to enhance key security. The discussion touches on the concept of repeating words in BIP39 seed phrases and addresses common misconceptions about randomness. The hosts discuss the vastness of possible Bitcoin private keys. They emphasize how the number of potential Bitcoin private keys far exceeds the number of atoms in the observable universe. This immensity is crucial for security, making it virtually impossible to guess a private key. They touch upon the importance of understanding magnitudes of size and recommend the book "Innumeracy" by John Allen Paulos. The discussion moves to the concept of seed phrases as deterministic treasure maps, enabling the generation of multiple child keys for different addresses, all derived from a single genesis number. They highlight the asymmetry between knowing a private key and proving ownership, which is fundamental to Bitcoin's functionality. The discussion transitions into modulo arithmetic, explaining it as focusing on remainders rather than quotients. This concept is introduced using simple examples, such as dividing by two and clock arithmetic. They also touch on the importance of modulo a prime number for elliptic curve cryptography. They explain that using a prime number ensures every non-zero number has a multiplicative inverse. This is critical for the field addition process, which is the mapping from a private key to a public key. The significance of congruence is discussed. Next, the hosts delve into elliptic curve cryptography and the specific curve used by Bitcoin which is Y squared equals X cubed plus seven. They explore the properties of this curve, including how any two points on the curve will intersect a third point. The intersection can be reflected across the X axis to find the sum of the original two points. This property is important to how elliptic curve cryptography works. They discuss the specifics of the LibSecP256K1 curve, explaining the origins of its name and its significance. They discuss an incident in 2013 where the NSA was caught trying to backdoor elliptic curve standards and the reason why Satoshi made the choices he did. The hosts talk about ECDSA (elliptic curve digital signing algorithm), which Satoshi used due to patents on Schnorr signing algorithm. Rob and Fundamentals then move on to discuss practical examples of how Bitcoin transactions are made and secured using elliptic curve cryptography. Rob states "all of the Bitcoin, everything is, I know a number." The hosts explain how the generator point is utilized to ensure that all potential outputs can be utilized in the system. Then Rob and Fundamentals discuss quantum computing and how this might threaten the security of the Bitcoin network, as these computers would be much more efficient at guessing private keys. Rob explains how Schnorr signing algorithms are more secure against quantum computers because all addresses look the same. The conversation touches upon the use of deterministic nonces to prevent key reuse. The podcast episode concludes by discussing how code can be made more secure at a software level, to prevent timing attacks on the network. Fundamentals references RFC 6979 which defines how to produce deterministic signatures for elliptic curve cryptography. They emphasize the importance of constant-time operations to prevent side-channel attacks. They highlight the significance of LibSecP, the battle-hardened cryptography library, in ensuring the security of Bitcoin transactions. They express pride in covering the material and hope listeners can at least start to begin to reason and understand where if you had a beer if you're at pub key you're having a beer and you want to talk about this stuff you may not be able to do the full mathematical proof of every line but at least you understand in aggregate the moving pieces and what's important and why things are important to be able to explain how this thing works.

• Transcript
• Chapters

Pascal's Wager, Blackjack, and Homeschooling

This is the second episode of the Internet Math podcast, where the hosts discuss their views on math, its connection to spirituality, and the importance of individual knowledge creation. Key Topics: Ice storm in Nashville The role of mathematics in spirituality and understanding the universe. Pascal's Wager and its relevance to decision-making, particularly in the context of Bitcoin. The importance of individual knowledge creation and critical thinking, especially in the face of technological advancements like AI. Critiques of the education system and the need for more meaningful engagement with mathematics. Card counting as an example of applying mathematical principles to real-world scenarios. Hal Finney and the selection of the LibSec P256K1 curve for Bitcoin. Out-of-sample bias and the challenges of making predictions, particularly in the context of Bitcoin's price cycles. Summary: The hosts begin by discussing the recent ice storm in Nashville and how it disrupted their schedule. This leads to a broader discussion about the importance of understanding patterns and avoiding faulty thinking, which sets the stage for the episode's focus on math and its significance. The hosts then transition to the main topic, emphasizing the idea of learning math for its own sake rather than as a means to an end. They express their belief that studying math can be a pathway to understanding the divine, describing it as a form of prayer and a way to explore the universe's logic. They reference historical figures like Pascal, who combined mathematical pursuits with religious beliefs, illustrating the natural connection between the two.

• Transcript
• Chapters

The Genesis Episode: Reteaching Math as a Liberal Art

Magic Internet Math Hub: https://mathacademy-cyan.vercel.app/index.html Brian Hirschfield X: @fundamentals21m npub12eml5kmtrjmdt0h8shgg32gye5yqsf2jha6a70jrqt82q9d960sspky99g Website: https://zeuspay.com/btc-for-institutions Rob Hamilton X: @Rob1Ham npub1emdtsxly9m68m00x206t574jttp65vk0c2m89ms038q047yz7ylqcac9aw Website: https://www.anchorwatch.com/ We’re launching Magic Internet Math. In this kickoff, Rob Hamilton and I set out our mission: to reteach math as a liberal art for Bitcoiners, builders, and anyone who wants conviction in their own reasoning. We share our origin story (a December 18th road‑trip call that should’ve been a podcast), define the show’s “bar‑level” approach to concepts like groups, fields, vector spaces, and probability, and connect them to real systems—Bitcoin, elliptic‑curve crypto, libsecp256k1, and why linear algebra underpins LLMs. We also talk survivorship bias in Bitcoin, the perils of rhetoric over first‑principles thinking, and how to stay sovereign in a world of shiny tools and FUD. We outline what’s coming next: deep‑dives on linear algebra and graph‑based knowledge for AI, approachable cryptography basics (binary/hex, finite fields), conversations with maintainers and researchers (e.g., libsecp256k1, FROST), and how to learn publicly—mistakes and all. If you’ve ever felt “the dumbest person at BitDevs,” this feed is your anonymous on‑ramp to build math legs without the priestly gatekeeping. 'Motivate the Math' podcast (Apple Podcasts): https://podcasts.apple.com/us/podcast/motivate-the-math/id1790329241 'libsecp256k1' (Bitcoin Core): https://github.com/bitcoin-core/secp256k1 'Bitcoin Core' (repo): https://github.com/bitcoin/bitcoin 'BIP‑32: Hierarchical Deterministic Wallets': https://github.com/bitcoin/bips/blob/master/bip-0032.mediawiki 'BIP‑340: Schnorr Signatures for secp256k1': https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki 'FROST: Flexible Round‑Optimized Schnorr Threshold Signatures' (RFC 9591): https://www.rfc-editor.org/rfc/rfc9591 'Programming Bitcoin' by Jimmy Song: https://programmingbitcoin.com/ 'Understanding Cryptography' (Paar, Pelzl, Güneysu) 2nd ed.: https://link.springer.com/book/10.1007/978-3-662-69007-9 'An Introduction to Statistical Learning' (official site): https://www.statlearning.com/home 'Base58' — Bitcoin protocol school: https://www.base58.info/ 'BitDevs' (NYC hub and resources): https://bitdevs.org/ 'Rock Paper Bitcoin' podcast (site): https://rockpaperbitcoin.fm/ 'Obsidian' (official site): https://obsidian.md 'Model Context Protocol' (official site): https://model-context-protocol.com/ 'Claude Code' by Anthropic: https://www.anthropic.com/claude-code/ 'Claude Opus 4.5' model page: https://www.anthropic.com/claude/opus 'AnchorWatch' — Bitcoin custody + insurance: https://www.anchorwatch.com/ 'BIP‑340 overview (alt mirror)' — bips.dev reference: https://bips.dev/340

• Transcript
• Chapters