Unverified50% confidenceFactExact time
IPFS使用Kademlia DHT的变体进行内容路由,理论查找复杂度为O(log n),但实际网络中查找延迟常达数十秒
1
Sources
50%
Confidence
Long-term
Relevance
8/27/2026
First Seen
Sources
Related Entities
Related Claims
Cite This Claim
Stable URI
https://kongchang.com/claim/809196API
curl https://kongchang.com/api/v1/knowledge/claims/809196MCP
get_claim(id=809196)