{
  "slug": "opacity",
  "term": "Opacity",
  "aliases": [
    "Transactional opacity"
  ],
  "definition": "Opacity is a transaction-correctness condition requiring committed, aborted and unfinished transactions to observe states consistent with a legal sequential execution that preserves transaction real-time order.",
  "note": "Scope: A transaction can observe its own writes and earlier committed effects in the sequential explanation; another transaction's aborted writes do not become shared state. Checking only committed transactions misses this obligation. [guerraoui08]\n\nPrefixes: The modern formulation requires every execution prefix to admit a suitable sequential explanation, with pending operations handled by completion rules. This explicit prefix condition is stated in Bila et al. Definition 4; the original 2008 paper discusses prefix closure separately in section 5.2. [bila20] [guerraoui08]\n\nApplication: Beldi targets opacity for its transactional workflows, with locking and distributed commit. Nontransactional access that bypasses those locks is outside that guarantee. [beldi20]\n\nConstructed example: Initially x = y = 0. One transaction atomically commits x = y = 1. A concurrent read-only transaction sees x = 0, then y = 1, and aborts. The writer alone has a serial committed history, but neither ordering of both transactions explains the reader's values. Aborting does not erase that observation. This illustrates the criterion, not an observed Beldi execution. [guerraoui08] [bila20]",
  "status": "research",
  "advantages": [],
  "limitations": [
    {
      "text": "Opacity is a safety condition, not a guarantee that a transaction eventually commits.",
      "citationIds": [
        "guerraoui08"
      ]
    },
    {
      "text": "Ordinary opacity does not by itself specify crash recovery or persistent storage; durable opacity adds a crash-aware contract.",
      "citationIds": [
        "bila20"
      ]
    }
  ],
  "related": [
    "beldi",
    "strict-serializability"
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "provenance": [
    "Primary-source synthesis, not an implementation test, proof or benchmark."
  ],
  "citations": [
    {
      "id": "guerraoui08",
      "label": "Original opacity definition",
      "title": "Rachid Guerraoui and Michal Kapalka. On the Correctness of Transactional Memory. PPoPP 2008, sections 4, 5.1-5.2 and 7.",
      "url": "https://kapalka.eu/files/opacity-ppopp08.pdf",
      "accessed": "2026-11-16"
    },
    {
      "id": "bila20",
      "label": "Prefix and crash-aware definitions",
      "title": "Bila et al. Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory. arXiv:2004.08200v1, Definitions 4-5.",
      "url": "https://arxiv.org/pdf/2004.08200v1",
      "accessed": "2026-11-16"
    },
    {
      "id": "beldi20",
      "label": "Beldi transactional scope",
      "title": "Zhang et al. Fault-tolerant and transactional stateful serverless workflows. OSDI 2020, section 6.2.",
      "url": "https://www.cis.upenn.edu/~sga001/papers/beldi-osdi20.pdf",
      "accessed": "2026-11-16"
    }
  ],
  "updated": "2026-11-16"
}
