Euled
24 October 2026
Abstract
Euled searches for Lean proofs from two ends: forward from Mathlib and backward from an open statement. It keeps a bank of every verified non-trivial sub-lemma and spends compute where coverage per cost is highest. This page lists each number with its source file. Items not yet run read "pending" with a date.
Solve
Shortest path to a proved node
Select a target node to see the bridge path
Top 5 Middle Points
Select a target node to see middle points
Submit a new problem: disabled until results are reviewed.
Loading theorem graph.
Inspector
Background run: pending (not started)
Select a node to inspect its statement, reach, bridge distance and proof links.
Statement.
| Downstream reach | pending |
| Bridge distance | pending |
| Coverage per cost | pending |
| Banked lemmas | pending |
Running now
Riemann Hypothesis. Euled works on Mathlib's statement without stopping, in 20-minute cycles, and saves every verified step and linked paper to its ontology. The panel below reads the live files and refreshes every 10 seconds. Open full screen.
IMO 1983, Problem 6 (miniF2F test). Solved by the two-sided search in its first generation on 24 October 2026, 23:13 EDT: the backward side proposed the sufficient condition (a-b)²(a+b-c) + (b-c)²(b+c-a) + (c-a)²(c+a-b) ≥ 0, which was then proved from the triangle inequalities. Checked by AXLE verify_proof against the original miniF2F statement. Lean proof. Search graph.