Verified65% confidenceFactExact time
The CAP theorem was proposed by Eric Brewer in 2000 and formally proved by Gilbert and Lynch in 2002, stating that a distributed system cannot simultaneously guarantee consistency, availability, and partition tolerance.
3
Sources
65%
Confidence
Long-term
Relevance
7/10/2026
First Seen
Sources
Agentic MapReduce：AI Agent 实现全代码库分布式推理的关键架构
rss7/1/2026
Related Claims
UnverifiedThe CAP theorem was proposed by Eric Brewer in 2000 and formally proved by Gilbert and Lynch in 2002, stating that only two of the three properties—consistency, availability, and partition tolerance—can be guaranteed simultaneously.84% similarUnverifiedThe CAP theorem was proposed by computer scientist Eric Brewer in 2000 and was later given a rigorous mathematical proof by Seth Gilbert and Nancy Lynch in 2002.75% similarUnverifiedCAP定理由加州大学伯克利分校教授埃里克·布鲁尔于2000年提出，并由吉尔伯特与林奇在2002年给出形式化证明61% similarUnverifiedIn 1931, Gödel proved the incompleteness theorems: any consistent formal system that includes arithmetic of natural numbers must contain propositions that can neither be proved nor disproved within the system, and the system cannot prove its own consistency internally.60% similarUnverified1999年Ng、Harada与Russell在ICML证明，只有基于势函数的奖励塑形（F(s,s')=γΦ(s')-Φ(s)）才能保证不改变最优策略58% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/462806API
curl https://kongchang.com/api/v1/knowledge/claims/462806MCP
get_claim(id=462806)