FCMP Divisors: The Inside Scoop
summary
Cypher Stack researchers identify that the original divisor derivation assumes classical calculus and that eighth-dimensional calculus is required to make the algebraic derivation rigorous. Using Cardano's formula fails to give rational slopes for lambda and mu in most cases, so the group reparametrizes: pick the three x-coordinates and a y parity bit to overdetermine the line and fix x-coordinates plus y-bit to force rationality, which yields verification equations with only an extraordinarily small failure probability.
AI-written summary · about
chapters (5)
- 0:00Introduction to research
- 12:49Ensuring mathematical rigor
- 16:55Elliptic curve background
- 21:36Roadblocks in derivation
- 24:49Solving the derivation
related talks
24mbig number small computer
49mCompiling to preserve our privacy
58mFast Cryptographic Code via Partial Evaluation
27mVerified Differential Privacy for Finite Computers
23mGenerating Programs for Polynomial Multiplication with Correctness Assurance
31mSequential Composition of Rational Proofs
01h 09mNew Developments in Multilinear Maps: Zeroizing Attacks, Defenses, and Post-Zeroizing Obfuscation
20mFixing the rusty core of the internet with functional prog.
