Proposed Term
CAP Theorem
Context
Source: catalog review of https://lawsofsoftwareengineering.com/.
Why it may qualify as an anchor: A formal theorem with precise boundaries — a distributed system can guarantee at most two of Consistency, Availability, Partition tolerance. Invoking it frames a concrete trade-off discussion for distributed data stores.
- Precise: formal theorem, exact terms
- Rich: triggers consistency-model, availability, partition reasoning
- Consistent: stable, textbook concept
- Attributable: Eric Brewer (2000 conjecture; Gilbert & Lynch 2002 proof)
Pre-assessment tier: ★★★ (self-standing).
Related existing anchors: event-driven-architecture, cqrs.
Pre-submission Checklist
Proposed Term
CAP Theorem
Context
Source: catalog review of https://lawsofsoftwareengineering.com/.
Why it may qualify as an anchor: A formal theorem with precise boundaries — a distributed system can guarantee at most two of Consistency, Availability, Partition tolerance. Invoking it frames a concrete trade-off discussion for distributed data stores.
Pre-assessment tier: ★★★ (self-standing).
Related existing anchors:
event-driven-architecture,cqrs.Pre-submission Checklist