To solve an equation, a computer often guesses, checks, then guesses again. Each round lands closer to the answer. But how much closer can one round get?
Newton's method asks two questions per round: the value of the function and its slope. Near the answer, the number of correct digits then doubles every round.
In 1974, Kung and Traub conjectured a speed limit. With n questions per round, the order can never exceed 2 to the power n−1. They had built methods reaching it. Nobody could prove it unbeatable.
Matthew Colbrook, at Cambridge, has now proved it. The trick: build functions that give the same answers but hide their zero elsewhere. A proof assistant, Lean, checked the result.
Source: Adversarial Wronskians: A proof of the Kung–Traub conjecture, https://arxiv.org/abs/2610.40660









