Lean harness ForShor verifies Shor's algorithm, including its asymptotic gate cost
Anirudh Suresh, Joshua M. Courtney, Runzhou Tao, and Yudong Cao prove correctness and gate-count theorems once for all valid policies (Toom-Cook multiplication designs, possibly from AI agents) and publish an open challenge at forshor.ai. At 2048 bits, a varying-arity policy gives about 1.685 trillion T-gates, against 1.820 trillion for the best single arity.

Checked against: arXiv:2611.20342VerifiedQC/ForShorpaperswithlean.com





