[KongchangAI]
Unverified50% confidenceFactExact time

液态卷积的计算复杂度与序列长度呈线性关系O(n),而非自注意力的平方关系O(n²),处理128K Tokens时计算量仅为注意力层的约1/1000

1
Sources
50%
Confidence
Medium-term (~90 days)
Relevance
7/2/2026
First Seen
Valid until: 9/30/2026

Sources

Related Claims

Cite This Claim

Stable URI
https://kongchang.com/claim/49059
API
curl https://kongchang.com/api/v1/knowledge/claims/49059
MCP
get_claim(id=49059)