{
  "status": "research",
  "advantages": [],
  "limitations": [],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-10-20",
  "slug": "optimistic-crash-consistency",
  "term": "Optimistic crash consistency",
  "aliases": [],
  "definition": "Optimistic crash consistency is a research approach that permits write reordering while preserving a recoverable consistent prefix.",
  "note": "OptFS distinguishes ordering-only osync from durable dsync. Checksums alone are insufficient: reuse and checkpointing also need control. Its timing-based durability approximation is an explicit prototype assumption, not a portable device guarantee. [optfs]",
  "related": [
    "persistence-ordering",
    "crash-consistency",
    "external-synchrony"
  ],
  "citations": [
    {
      "id": "optfs",
      "title": "Chidambaram et al. Optimistic Crash Consistency. SOSP 2013, sections 4-6. DOI: 10.1145/2517349.2522726.",
      "url": "https://research.cs.wisc.edu/wind/Publications/optfs-sosp13.pdf",
      "accessed": "2026-10-20"
    }
  ]
}