Unverified50% confidenceFactExact time
默克尔树可生成默克尔证明，以 O(log n) 复杂度证明某条记录属于整个数据集而无需暴露全部数据
1
Sources
50%
Confidence
Long-term
Relevance
7/9/2026
First Seen
Sources
The Halo Open-Source Project: Building Tamper-Evident Runtime Evidence for AI Agents
hackernewshackernews7/7/2026
Related Claims
UnverifiedEmbedding models map text to high-dimensional dense vectors (typically 768 to 3072 dimensions), and ANN algorithms (such as HNSW and IVF-PQ) reduce retrieval complexity from O(n) to approximately O(log n).63% similarUnverifiedTree-sitter reduces the time complexity of incremental parsing from O(n) to approximately O(k), where k is the number of changed characters.61% similarUnverifiedAST-based chunking using tree-sitter improves retrieval accuracy compared to splitting by line count or character count, because it returns complete logical code units60% similarUnverifiedMEMOIR uses Semantic Paths instead of flat UUID indexes to organize memories, reducing retrieval complexity from O(n) to O(log n).60% similarUnverifiedReact's Fiber architecture optimizes the O(n³) complexity of traditional tree comparison to O(n).59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/313523API
curl https://kongchang.com/api/v1/knowledge/claims/313523MCP
get_claim(id=313523)