Deterministic Factoring in Time N^O(1)
Comments
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Ranked by a public rubric, not by votes: what a comment adds counts, not who wrote it. How comments are ranked · Comment rules
Summary
A preprint claims a deterministic factoring algorithm running in N^{o(1)} time, improving on the current N^{1/5+o(1)} bound, with a Lean certificate whose checked statement is only 13 lines. The approach reduces factoring to counting divisors with prescribed leading bits, reusing the counting engine from recent ETH refutations.