Unverified50% confidenceBenchmarkExact time
On the Erdős minimum overlap problem, the TTT-Discover recipe of "eight groups × 64 rollouts plus one LoRA update" reached a certified C₅ upper bound of 0.38094 within 25 steps.
1
Sources
50%
Confidence
Medium-term (~90 days)
Relevance
10/17/2026
First Seen
Valid until: 1/15/2027
Sources
Related Entities
Related Claims
UnverifiedOn the Packing 26 problem, the TTT-Discover recipe reached a certified radius sum of 2.635983 within 50 steps, exactly the same as the 2.635983 reported by TTT-Discover, with a target of 2.636, where higher is better.79% similarUnverifiedThe target value for the Erdős minimum overlap problem is 0.38080, where lower is better; the value reported by TTT-Discover is 0.38093, and this run's result of 0.38094 is almost identical to the reported value but still has a tiny gap from the target.78% similarUnverifiedIn tests on 2,456 held-out prompts, increasing the sampling steps from 20 to 50 improved FID only from 27.0 to 26.6 (a gain of 0.4), while removing the shift caused FID to rise from 27.0 to 27.3 and FD-DINOv2 to rise from 218 to 228.63% similarUnverified46个模型中有41个完整跑完全部28道题，3个因服务错误未完成，GPT-5.6 Terra因配额限制止步24/28，GPT-6 Astra只跑了1道题63% similarUnverifiedIn the Automation Bench test, GPT-6 Sol's extra high tier achieved first place 33% of the time, while 5.6's max effort scored 28.8.62% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1054051API
curl https://kongchang.com/api/v1/knowledge/claims/1054051MCP
get_claim(id=1054051)