Skip to content

[Anchor Proposal]: CAP Theorem #508

@raifdmueller

Description

@raifdmueller

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

  • Searched existing anchors — not present
  • Well-established concept

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Type

    No type
    No fields configured for issues without a type.

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions