Unverified50% confidenceFactExact time
IPFS使用Kademlia DHT的变体进行内容路由，理论查找复杂度为O(log n)
1
Sources
50%
Confidence
Long-term
Relevance
8/26/2026
First Seen
Sources
Related Entities
Cite This Claim
Stable URI
https://kongchang.com/claim/806449API
curl https://kongchang.com/api/v1/knowledge/claims/806449MCP
get_claim(id=806449)