Partially Verified75% confidenceFactExact time
ETH has not been proved or disproved to date, but it has become a cornerstone assumption in fields such as parameterized complexity and exact algorithm design.
3
Sources
75%
Confidence
Long-term
Relevance
10/26/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe core assertion of ETH is that no algorithm solves 3-SAT in subexponential time, specifically in the form 2^Ω(n).69% similarUnverifiedThere are mainly two ways to disprove ETH: one is to construct a concrete subexponential algorithm; the other is to prove through some non-constructive argument that such an algorithm must exist.68% similarUnverifiedIMO problems cannot be solved directly through memorized training data or statistical patterns but require constructing rigorous logical proof chains, which is considered a more reliable standard for testing whether AI truly understands mathematical structure.67% similarUnverifiedThe AI industry has not yet formed a unified standard for what kind of evidence is sufficient to demonstrate that a frontier model is safe.66% similarUnverifiedWhether AI-generated proofs or derivations are reliable, and how to verify mathematical arguments given by models, are questions on which the academic community has not yet reached a consensus.66% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1101256API
curl https://kongchang.com/api/v1/knowledge/claims/1101256MCP
get_claim(id=1101256)