Lean Refactor uses retrieval-augmented agentic strategy search to multi-objectively refactor Lean proofs, achieving over 70% token compression and up to 60% faster compilation with stronger version transfer.
CORVUS decouples file reads from observations via synchronized registries, cutting input tokens by 9-50% and reasoning cycles by up to 37% while preserving pass rates.
UI traces from LLM web agents identify underlying models with 96% F1 via passive JavaScript tracking, though randomized delays only partially mitigate fingerprinting.
s2n-bignum-bench evaluates LLM theorem proving on verified industrial cryptographic assembly using HOL Light proof synthesis. It provides a challenging, practically relevant benchmark beyond competition mathematics.