Unverified50% confidenceBenchmarkExact time
For a full-support Beta(1,1)-Bernoulli target, under the output-law criterion, the exact expected cost is (e^{-ε}/2+o(1))log_2 log_2 n, achieved through rare n-round executions.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedFor the balanced target, the number of rounds required as measured by output-law divergence drops sharply to (e^{-ε}+o(1))log_2 ln n, i.e., the double-logarithmic scale.77% similarUnverifiedEven when approximating only a single fixed affine function, at a sufficiently high confidence level, the cost of the output layer must reach ((1-p)/p)ε^{-2}log(1/δ).75% similarUnverifiedThe academic community conjectures that the optimal complexity lower bound for integer multiplication is Ω(n log n), but this has not been rigorously proved to date and remains an empirical conjecture.64% similarUnverifiedOutlines 推理时将非法 token 对应的 logits 设为负无穷，使其经 softmax 后概率趋近于零，实现硬约束64% similarUnverifiedTo reduce prediction error to level τ, the required number of states or modes is r=Θ(log²(1/τ)), i.e., the square-logarithmic state complexity law.64% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1002159API
curl https://kongchang.com/api/v1/knowledge/claims/1002159MCP
get_claim(id=1002159)