My math website is fully versed in Rudolf Steiner’s seminal work. It’s a cornerstone in teaching math as a liberal art.
View quoted note →
Phundamentals
ph@nostrplebs.com
npub12eml...y99g
Author: Bitcoin for Institutions
https://zeuspay.com/btc-for-institutions
Co-Host of Rock-Paper-Bitcoin, Motivating the Math, Sound Coffee, and Back on the Chain podcasts
Study math, be sovereign
It’s remarkable that the wokes who all want to promote women all ignore Emmy Noether.
View quoted note →
Since markets opened on the Iran war (3/2):
🟠 Bitcoin: +6.7%
🟡 Gold: -0.4% (gave back its entire spike)
📉 S&P 500: -1.5%
🏦 10Y Bonds: SOLD OFF (+17bps)
Gold spiked, then faded. Bonds failed completely.
Bitcoin is the only war trade that actually worked.
Flight to safety is being redefined in real time. 🦡
Don’t talk to me about spam. Tell me why your scarce time is better spent creating a new problem to solve the old one instead of just building.
You can’t do both.
Bitcoin is the first Standard Basis of money
View quoted note →
https://www.fountain.fm/episode/qTF5i2hYxgbbC0W2lgOl
Bitcoin doesn’t need more believers. It needs more understanders. Come aboard in conversational form - then access the free textbooks and YouTube videos.
Appreciate the clip. Hope people understand the context the way you do. Nothing is given.
View quoted note →
The inverse problem in Bitcoin cryptography:
Given P = kG (public key = private key × generator point), finding k is the discrete logarithm problem — computationally infeasible.
But step back: why does k⁻¹ exist at all?
THEOREM: In a finite field 𝔽ₚ where p is prime, every non-zero element a has a multiplicative inverse a⁻¹ such that a × a⁻¹ ≡ 1 (mod p).
PROOF: By Fermat's Little Theorem, a^(p-1) ≡ 1 (mod p) for any a ≠ 0.
Therefore: a × a^(p-2) ≡ 1 (mod p)
So: a⁻¹ = a^(p-2)
This is why Bitcoin works. Not luck — mathematical certainty.
New episode breaks it down: fountain.fm/show/2gdYQCIV0eZEuYOW3nGJ
🔑 Magic Internet Math Episode 4: Why the Inverse Problem Works
Bitcoin's security rests on the inverse problem — but why does an inverse even EXIST?
This isn't "the math is hard." This is PROOF that every non-zero element in a finite field 𝔽ₚ has a multiplicative inverse.
We cover:
Euclidean Algorithm (computing inverses)
Fermat's Little Theorem (a^(p-1) ≡ 1 mod p)
Why secp256k1 uses a prime field
Group & field axioms (closure, identity, inverse)
LibSecP implementation
92 minutes with @Rob Hamilton 📖 Study guide: ecc-study-guide.magicinternetmath.com/guide.pdf
🎧 Listen: fountain.fm/show/2gdYQCIV0eZEuYOW3nGJ
Bitcoin isn't probably secure. It's PROVABLY secure.
⚡ Value-enabled.
I loved this conversation!
View quoted note →
Got a new bot - gonna be dropping math knowledge on Nostr.
I’m gonna fix the LaTeX formatting.
Follow it and visit magicinternetmath.com to start leveling up
View quoted note →
I just mass-loaded 96 math courses onto Nostr.
High school algebra through elliptic curve cryptography. Euclid's Elements through FROST threshold signatures. Austrian economics through stochastic calculus. 5,000+ interactive sections.
All free. All for Bitcoiners.
Because if you can't explain why Bitcoin uses a 256-bit curve, you don't understand the security model. If you can't follow a Schnorr signature derivation, you're trusting someone else's math. And if you're trusting someone else's math, you're a second-class citizen in Bitcoin.
The bot drops a daily lesson — definitions, theorems, worked examples, the whole thing. Follow it. Zap it when it teaches you something. Mute it if you'd rather stay ignorant.
npub17pnjaleu0wwwmjpk3ns74xwv8njwlu3jgqc6g5d0ef4z890t8c3s5w0e55
https://fountain.fm/episode/HGoXljfsj1VtapZ3ruVA
@Bassload comes back on the chain and gives us his energy. Great times between band mates!
Ever wonder about the math behind your Nostr keys? It's the same elliptic curve cryptography that secures Bitcoin.
I made a 13-episode video series that builds the whole thing from scratch — modular arithmetic → finite fields → elliptic curves → secp256k1 → ECDSA → Schnorr → MuSig2.
Every concept has interactive visualizations. No prerequisites beyond basic arithmetic.
Your Nostr private key is a 256-bit scalar. Your public key is that scalar multiplied by a generator point on the secp256k1 curve. After watching this series, you'll understand exactly what that means and why it works.
Free on YouTube: https://www.youtube.com/playlist?list=PLaAxhhFb7OVElRJ8Su_C2Xu2uA7WiBKKz
Interactive course:
#bitcoin #cryptography #education #ellipticcurves #secp256k1 #math #nostr

Magic Internet Math
Interactive courses covering the mathematics that powers modern technology, from foundational algebra to the cryptography securing the internet.
Learn the Math of Elliptic Curve Cryptography
https://www.youtube.com/playlist?list=PLaAxhhFb7OVElRJ8Su_C2Xu2uA7WiBKKz
This is a 13-part series that starts from absolute zero (what is modular arithmetic?) and builds all the way to MuSig2 multi-signatures — the same elliptic curve cryptography that secures every Bitcoin transaction.
Every episode has interactive visualizations so you can see point addition, scalar multiplication, and signature verification happen in real time on the secp256k1 curve.
Topics covered:
- Modular arithmetic and finite fields
- Elliptic curves and the group law
- Point addition and scalar multiplication
- The secp256k1 curve and its parameters
- Private keys, public keys, and Bitcoin addresses
- ECDSA signatures (signing and verification)
- Schnorr signatures
- MuSig2 multi-signatures
No prerequisites — if you can add and multiply, you can follow along.
Built this because when I was learning Bitcoin's cryptography, I couldn't find anything that was both rigorous and visual. The existing resources were either hand-wavy ("it's one-way math, trust us") or dense academic papers. This tries to be the thing in between.
Free to watch. If you want to support the project:
https://stacker.news/items/1440020

Magic Internet Math
Interactive courses covering the mathematics that powers modern technology, from foundational algebra to the cryptography securing the internet.
