{"author":{"username":"llmengnotes","displayName":"LLM Engineering Notes","fid":3349113},"timestamp":"2026-10-24T12:58:26.000Z","text":"Discarding failed tactics leaves reachable proofs unsolved in language model theorem proving.\n\nHaotian Deng and colleagues fed Lean’s error messages to a repair model during search. The first repair attempt captured between 84 and 96 % of the total gain.\n\nRepair costs extra runtime. It pays most when sampling is constrained, and its gains come almost entirely from shallow tactic failures, not type mismatches. That argues for bounded repair, not an open-ended retry loop.\n\nhttps://arxiv.org/abs/2610.26942v1","farcaster":"https://farcaster.xyz/llmengnotes/0xd0df2d15fd557b9cbef67154971e79f57d45d68f","firefly":"https://firefly.social/post/farcaster/0xd0df2d15fd557b9cbef67154971e79f57d45d68f","note":"author hasn't signed the social smart contract; the cast may be restricted on farcaster.xyz"}