Vegas Recap and Elliptic Curve Point Operations

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

Vegas Recap and Elliptic Curve Point Operations

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

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.

Elliptic Curve Cryptography: Discrete Log Problem & Quadratic Residues

The Study guide: https://ecc-study-guide.magicinternetmath.com/guide.pdf [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.

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.