aspireai.
PUBLIC EDITION

Maestro coordinated a Lean prover around its failures instead of decomposing harder, and solved all 6 IMO 2026 problems plus 669 of 672 PutnamBench targets

AspireAI community · arXiv
Maestro is a Lean prover harness that treats a failed proof attempt as a report rather than a dead end. Provers state why they failed, and a coordinator that can see the whole proof decides whether to guide a stuck prover, correct a false lemma, or retract a flawed subtree and replan. On the benchmarks the authors share with prior systems it beats the best published result: 669 of 672 on PutnamBench against 597 for Goedel-Architect, 59 of 60 on Lean-IMO-Bench against 42 for LEAP, and 76 of 77 on AlgoVeri against 65 for IDS, plus all six IMO 2026 problems. Averaged across four backbones the plain coding agent proved 33 targets and Maestro proved 54, a 63 percent improvement that holds on every backbone. The limitation is real: coordination costs more tokens on hard problems, with a median 2.0 million output tokens on the proved hard set, and the gains are largest on research-level mathematics rather than on routine software verification.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.