Fundamentals. @Fundamentals21m
Book: https://zeuspay.com/btc-for-institutions
npub12eml5kmtrjmdt0h8shgg32gye5yqsf2jha6a70jrqt82q9d960sspky99g
AverageGary
npub160t5zfxalddaccdc7xx30sentwa5lrr3rq4rtm38x99ynf8t0vwsvzyjc9
Cryptography Wookbook: https://github.com/cryptography-camp/workbook
---- navigate to the current release on the right tab to download the workbook
---- DO NOT LISTEN TO THE EPISODE UNLESS YOU HAVE THE WORKBOOK HANDY
We’re back and recommitting to our North Star: getting comfortable with the math behind Bitcoin-grade cryptography. In this kickoff, we set the stage for a multi‑episode journey through a cryptography “workbook” on discrete‑log‑based multiparty signatures—using it as a scaffold to build real intuition for groups, fields, rigor, and proofs without being intimidated by jargon. We talk prerequisites (Z_p operations, cyclic groups, conditional probability, union bound, proof by contraposition), why rigor matters more than vibes, and how abstraction lets us reason cleanly about things like elliptic‑curve “addition” and key‑tweaking. We also peek at the table of contents we’ll tackle: negligible functions, games and asymptotic security, hash functions and collision resistance, commitments and accumulators (hello, Utreexo), one‑time and Lamport signatures, the discrete log problem, Pedersen commitments, DDH, ElGamal, the random‑oracle model and forking lemma, all the way to Schnorr signatures, key‑tweaks, and interactive aggregate signatures (e.g., DahLIAS). Expect a mix of precise definitions, worked examples, and occasional reinforcements from friends smarter than us—plus some probability detours like Monty Hall and Poisson to keep our statistical muscles warm.
