{
  "slug": "optimal-access-repair",
  "term": "Optimal-access repair",
  "aliases": [
    "Optimal access",
    "Access-optimal repair"
  ],
  "definition": "Optimal-access repair attains a code's repair-bandwidth bound by reading and forwarding only the stored symbols needed from its helpers.",
  "note": "At the minimum-storage point, any k of n nodes recover the file. Symmetric single-node repair from d helpers, with k <= d < n, has a download bound of dL/(d-k+1) symbols for L symbols per node. Optimal access attains this with the same number of helper-symbol reads. State the failed-node class and eligible helper sets: systematic-node optimality alone does not cover parity failures. [tamo]\n\nA six-node, four-data-node example stores two GF(7) symbols per node. Its published repair schedule sends five symbols for any one lost data node. Repairing N1 or N2 reads five stored symbols; repairing N3 or N4 reads ten to form five combinations. Both schedules meet the five-symbol bandwidth bound, but their access costs differ. These counts follow from the verified linear maps, not a disk benchmark. [example]\n\nForwarding selected symbols needs no helper-side arithmetic, but reconstructing the failed node can still require decoding. At the device boundary, alignment and fragmented sub-chunks can make physical reads larger than the logical symbol budget. [clay]",
  "related": [
    "minimum-storage-regenerating-code",
    "repair-by-transfer",
    "subpacketization",
    "clay-code",
    "repair-read-amplification",
    "maximum-distance-separable-code"
  ],
  "status": "limited",
  "advantages": [],
  "limitations": [
    {
      "text": "A symbol-access optimum does not establish the fastest repair: request layout and I/O granularity also affect cost.",
      "citationIds": [
        "clay"
      ]
    }
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-22",
  "citations": [
    {
      "id": "tamo",
      "title": "Tamo, Wang and Bruck. Access vs. Bandwidth in Codes for Storage (2013), arXiv:1303.3668v1, sections I-II and V.",
      "url": "https://arxiv.org/abs/1303.3668v1",
      "accessed": "2026-11-22"
    },
    {
      "id": "clay",
      "title": "Vajha et al. Clay Codes: Moulding MDS Codes to Yield an MSR Code. FAST 2018, sections 2 and 5.2.",
      "url": "https://www.usenix.org/system/files/conference/fast18/fast18-vajha.pdf",
      "accessed": "2026-11-22"
    },
    {
      "id": "example",
      "title": "Hesela: exact GF(7) verification of the six-node repair example and its logical read counts.",
      "url": "https://hesela.dev/research/repair-transfer-access.test.mjs",
      "accessed": "2026-11-22"
    },
    {
      "id": "reading",
      "title": "Hesela: Local repair is not whole-node repair",
      "url": "https://hesela.com/analyses/lrc-repair-costs-locality/",
      "accessed": "2026-11-22"
    }
  ],
  "provenance": [
    "The primary preprint's Figure 1 coefficients and repair schedule were reconstructed independently. No throughput, latency or physical-device measurements are inferred.",
    "Tests check every four-node subset for full rank and every data-node repair on a field basis; linearity extends correctness to all 7^8 input messages.",
    "The finite example covers the published systematic-node schedule only, not all possible repair algorithms, parity-node repair or arbitrary helper sets."
  ]
}
