What does Library Conflicts, Reproducibility and Erasure Codes conclude, in numbers, about “The Reliability of Replicas and Erasure Codes: Binomial Windows, Markov Chains and Scrubbing for Bit Rot”?

Answer: Chapter 6 computes yearly data-loss probabilities with a binomial window model and Markov chains, showing that a twofold correlated acceleration of failures shrinks the MTTDL by 15.9 times and that, with a scrub every five years and no per-block checksums, a read returns wrong bytes with probability 0.11820.

Scope of the numbers: Library sizes, error rates, hazards and failure rates are illustrative; all calculations are generated by the programs in the book; the book is not legal, financial, procurement or storage-service advice. Chapter 1 draws the library as a knowledge graph and shows that the more volumes there are, the fewer places an error can hide: at 200 volumes, 0.9821 of deviant definitions in the illustrative library sit where another volume can contradict them.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 15.9

schemeMTTDL 1 dapprox 1 dMTTDL 7 dlibrary loss
yearsyearsyearsper year, 7 d
2 copies4.472e+054.471e+056.395e+046.087e-01
3 copies2.693e+092.693e+095.504e+071.090e-03
RS(6+3)9.661e+109.653e+102.831e+083.533e-05
RS(10+4)2.198e+132.195e+139.229e+096.502e-07
RS(10+4), 7 d, failures 2x faster after the first: MTTDL / 15.9
RS(10+4), 7 d, failures 5x faster after the first: MTTDL / 615.2
Show the full program
# Chapter 6. p62: mean time to data loss (MTTDL) from a continuous-time
# Markov chain. State i = number of failed disks in a stripe of n that
# survives m failures; i -> i + 1 at rate (n - i) lam B^min(i, 1), and
# i -> i - 1 at repair rate mu (one rebuild at a time). State m + 1 is
# data loss. Expected times to absorption are solved exactly by Gaussian
# elimination. lam from AFR 0.02; mu = 365 / R for a rebuild of R days;
# B > 1 makes the surviving disks fail faster once one has failed (same
# batch, same rack), a crude form of correlation. All values illustrative.
import math

AFR, BLOCKS = 0.02, 60000
LAM = -math.log(1 - AFR)


def mttdl(n, m, rdays, boost=1.0):
    mu = 365 / rdays
    size = m + 1
    a = [[0.0] * size for _ in range(size)]
    b = [1.0] * size
    for i in range(size):
        up = (n - i) * LAM * (boost if i else 1.0)
        down = mu if i else 0.0
        a[i][i] = up + down
        if i + 1 < size:
            a[i][i + 1] = -up
        if i:
            a[i][i - 1] = -down
    for c in range(size):
        for r in range(c + 1, size):
            f = a[r][c] / a[c][c]
            a[r] = [x - f * y for x, y in zip(a[r], a[c])]
            b[r] -= f * b[c]
    t = [0.0] * size
    for r in range(size - 1, -1, -1):
        rest = math.fsum([a[r][j] * t[j] for j in range(r + 1, size)])
        t[r] = (b[r] - rest) / a[r][r]
    return t[0]


def approx(n, m, rdays):
    mu = 365 / rdays
    den = math.prod(n - i for i in range(m + 1)) * LAM ** (m + 1)
    return mu ** m / den


SCHEMES = (("2 copies", 2, 1), ("3 copies", 3, 1), ("RS(6+3)", 9, 6),
           ("RS(10+4)", 14, 10))
print("{:<9} {:>12} {:>12} {:>12} {:>14}".format(
    "scheme", "MTTDL 1 d", "approx 1 d", "MTTDL 7 d", "library loss"))
print("{:<9} {:>12} {:>12} {:>12} {:>14}".format(
    "", "years", "years", "years", "per year, 7 d"))
for name, n, k in SCHEMES:
    m = n - k
    t7 = mttdl(n, m, 7)
    lib = -math.expm1(-(BLOCKS / k) / t7)
    print("{:<9} {:>12.3e} {:>12.3e} {:>12.3e} {:>14.3e}".format(
        name, mttdl(n, m, 1), approx(n, m, 1), t7, lib))
base = mttdl(14, 4, 7)
for beta in (2.0, 5.0):
    print("RS(10+4), 7 d, failures {:.0f}x faster after the first: MTTDL"
          " / {:.1f}".format(beta, base / mttdl(14, 4, 7, beta)))

Single source and citation

Fan, Y. (2026). Cross-Volume Theorem-Conflict Detection in Large Bilingual Monograph Libraries, Anti-Decay of Code Reproducibility and Erasure-Coded Cold Storage (Version 1.0.0), Chapter 6: The Reliability of Replicas and Erasure Codes: Binomial Windows, Markov Chains and Scrubbing for Bit Rot. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-182 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026182,
  author    = {Fan, Yafu},
  title     = {Cross-Volume Theorem-Conflict Detection in Large Bilingual Monograph Libraries, Anti-Decay of Code Reproducibility and Erasure-Coded Cold Storage},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book