Motivate the Math

Fundamentals.  @Fundamentals21mnpub12eml5kmtrjmdt0h8shgg32gye5yqsf2jha6a70jrqt82q9d960sspky99gAverageGarynpub160t5zfxalddaccdc7xx30sentwa5lrr3rq4rtm38x99ynf8t0vwsvzyjc9Dr. Peyam Youtubehttps://www.youtube.com/c/drpeyamBIP340https://github.com/bitcoin/bips/tree/master/bip-0340 In this episode, we dive into the world of mathematics and cryptography, exploring the nuances of teaching and learning math as an art form. We discuss the importance of passionate educators and the impact they have on students, drawing parallels between teaching and creative expression. The conversation touches on the struggles of learning complex subjects, like math, and the joy that can be found in understanding and mastering them. We also highlight the role of coding in appreciating math as an art and the satisfaction that comes from solving complex problems through code.We further explore the intricacies of cryptographic protocols, focusing on Schnorr signatures and their advantages over ECDSA, particularly in the context of multisignature schemes. The discussion delves into the technical aspects of Schnorr's linearity and closure properties, and how protocols like Frost and Musig enhance its functionality. We also touch on the broader implications of cryptography in ensuring privacy and sovereignty, emphasizing the need for a deeper understanding of math to fully grasp these concepts. The episode concludes with reflections on the importance of local collaboration and the potential for Bitcoin to drive hyper-localization in cryptographic practices.

A Mathemetician's Lamenthttps://cdn.satellite.earth/473cc46a079cb18196fb3b9b11933b373b607d5e3f8b5e581f3147387b0f17dd.pdfLearn Me a Bitcoin: Schnorrhttps://learnmeabitcoin.com/technical/cryptography/elliptic-curve/schnorr/Fundamentalsnpub12eml5kmtrjmdt0h8shgg32gye5yqsf2jha6a70jrqt82q9d960sspky99gAverageGarynpub160t5zfxalddaccdc7xx30sentwa5lrr3rq4rtm38x99ynf8t0vwsvzyjc9

Motivate the Math Nostr Communityhttps://satellite.earth/n/MotivateTheMath/npub12eml5kmtrjmdt0h8shgg32gye5yqsf2jha6a70jrqt82q9d960sspky99gA First Course in Abstract Algebra Textbookhttps://a.co/d/ekzPCaQIsomorphism Between Elliptic Curve Addition and "Regular" Additionhttps://math.stackexchange.com/questions/3831478/isomorphism-between-elliptic-curve-group-over-mathbb-r-and-0-1-under-addiHasse's Boundhttps://planetmath.org/hassesboundforellipticcurvesoverfinitefieldsBitcoin's Prime Numberhttps://math.stackexchange.com/questions/3931161/is-secp256k1s-prime-primeFundamentals.  @Fundamentals21mnpub12eml5kmtrjmdt0h8shgg32gye5yqsf2jha6a70jrqt82q9d960sspky99gAverageGarynpub160t5zfxalddaccdc7xx30sentwa5lrr3rq4rtm38x99ynf8t0vwsvzyjc9

Proofshttps://www.youtube.com/watch?v=HIkIqt_ytdcFermat's Little Theorem https://mathworld.wolfram.com/FermatsLittleTheorem.html Euler's Function https://en.wikipedia.org/wiki/Euler's_totient_function Elliptic Curves: Point Addition https://www.rareskills.io/post/elliptic-curves-finite-fields  Fundamentals npub12eml5kmtrjmdt0h8shgg32gye5yqsf2jha6a70jrqt82q9d960sspky99g AverageGary npub160t5zfxalddaccdc7xx30sentwa5lrr3rq4rtm38x99ynf8t0vwsvzyjc9

2^173(mod5) = (2^4)^43 * 2^1 = 1^43 * 2^1 = 1 * 2 = 2 2^4(mod5) = 1 because 16(mod5) = 1Fermat's Little Theorem https://mathworld.wolfram.com/FermatsLittleTheorem.htmlEuler's Function https://en.wikipedia.org/wiki/Euler's_totient_functionElliptic Curves: Point Addition https://www.rareskills.io/post/elliptic-curves-finite-fieldsDiffie-Hellman Illustration https://www.youtube.com/watch?v=NmM9HA2MQGIFundamentals npub12eml5kmtrjmdt0h8shgg32gye5yqsf2jha6a70jrqt82q9d960sspky99gAverageGary npub160t5zfxalddaccdc7xx30sentwa5lrr3rq4rtm38x99ynf8t0vwsvzyjc9In this episode, we dive deep into the fascinating world of elliptic curves and their significance in cryptography. We start by discussing the basics of elliptic curves, particularly focusing on the polynomial equation y² = x³ + 7, which is crucial for Bitcoiners. We explore how operations on these curves, like adding points, form a group and why this concept is important.We then delve into the textbook by Neil Koblitz, which highlights the importance of elliptic curves in cryptography. The discussion transitions into the axioms of groups, such as closure, associativity, identity, and inverses, and how these relate to elliptic curves.Our conversation takes a turn towards Fermat's Little Theorem and its application in cryptography, particularly in computing inverses in finite fields. We explore how this theorem simplifies calculations with large numbers and its implications for public key cryptography.We also touch on the Diffie-Hellman key exchange, explaining how it enables secure communication over the internet by deriving a shared secret without exposing private keys.Throughout the episode, we emphasize the importance of understanding these mathematical concepts to grasp the underpinnings of cryptographic systems, especially in the context of Bitcoin and other cryptocurrencies.

What is a Relationhttps://www.youtube.com/watch?v=1v0qH4l9A2c&list=PLg8ZEeSiXsjgoQJzRcq60GjK0UrkMsA3-&index=12What is an Equivalence Relationhttps://www.youtube.com/watch?v=o-PhSZztHC0&list=PLg8ZEeSiXsjgoQJzRcq60GjK0UrkMsA3-&index=13Modular Arithmetic (a little advanced but its good support until I find something simpler)https://www.youtube.com/watch?v=d-n92Ml1iu0&list=PLDDGPdw7e6Ag1EIznZ-m-qXu4XX3A0cIz&index=78Fundamentalsnpub12eml5kmtrjmdt0h8shgg32gye5yqsf2jha6a70jrqt82q9d960sspky99gAverageGarynpub160t5zfxalddaccdc7xx30sentwa5lrr3rq4rtm38x99ynf8t0vwsvzyjc9In this episode, we delve into the intricate world of cryptography, focusing on the mathematical foundations that underpin modern cryptographic systems. We start by exploring the AES chapter from the "Understanding Cryptography" PDF, discussing the layers beyond the mathematical sections. Our conversation highlights the importance of understanding both the cryptographic implementations and the mathematical relevance behind them, particularly in the context of public and private key cryptography, such as RSA and elliptic curve cryptography.We emphasize the significance of modular arithmetic, describing it as a fundamental substrate for cryptography. The discussion includes personal anecdotes about internalizing modular arithmetic and the continuous learning journey in understanding its applications. We also touch upon the Euclidean algorithm and its role in finding the greatest common divisor, which is crucial for cryptographic functions.The episode further explores the concept of cyclic groups and their relevance in cryptography, particularly in how they can reorder elements to enhance security. We discuss the importance of understanding linear combinations and equivalence relationships, which are foundational in mathematical modeling and cryptographic analysis.We also address some errata from previous episodes, clarifying definitions related to binary operations and cyclic groups. The conversation is enriched with practical examples, such as prime factorization and its role in cryptographic algorithms.Finally, we express gratitude to our listeners and those who have supported the podcast through boosts, encouraging them to engage with the material at their own pace and to explore additional resources provided in the show notes.

Wrath of Math:   https://www.youtube.com/watch?v=VzsAehzmjrU&list=PLztBpqftvzxVvdVmBMSM4PVeOsE5w1NnNA Book of Abstract Algebra: https://www.amazon.com/Book-Abstract-Algebra-Second-Mathematics/dp/0486474178/ In this second episode of "Motivate the Math," we dive into the foundational concepts of group theory, a crucial element in understanding cryptography and mathematics. We start by addressing feedback from our first episode, emphasizing the importance of making math accessible and correcting any inaccuracies. We introduce the concept of an errata to keep ourselves accountable and transparent.We then explore the definition of a group in mathematics, discussing its four key axioms: closure, associativity, identity, and inverse. We explain how these properties are essential for a set of elements to be considered a group and why this matters in the broader context of math and cryptography. We also touch on the concept of commutativity, or Abelian groups, and introduce the idea of cyclic groups.Throughout the episode, we reflect on the feedback and support from our listeners, sharing some of the boosts and messages we've received. We discuss the motivation behind the podcast and the desire to make complex mathematical concepts more digestible and engaging.As we wrap up, we hint at future topics, including rings and fields, and the importance of understanding these concepts for cryptography. We also discuss the need for additional resources and problem-solving sessions to support the podcast's content, emphasizing the collaborative nature of learning and the journey we're on together.