What does Disaster Recovery and Threshold Shares conclude, in numbers, about “Off-Site Incremental Snapshots: Recovery Point, Recovery Time and Mean Time to Data Loss”?

Answer: Chapter 4 computes off-site incremental snapshots: hourly incrementals push the worst recovery time to 51.11 hours, an hourly chain of 168 links is intact with probability only 0.8453 without read-back checks, and two copies last 30.0 years on average without repair and 10430.0 years with weekly repair.

Scope of the numbers: Chapter 6 computes self-rescue after one share goes missing: losing the fastest holder is like raising the threshold by one, and the illustrative rescue window is 263 hours. Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.

中文版

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: 168, 51.11

data 400 GB, change 8 GB/day, restore 50 GB/h, 0.25 h per step
scheduleRPO maxRPO meanRTO maxGB/week
weekly full only168 h84.0 h8.25 h400.0
weekly full + daily incr24 h12.0 h10.71 h448.0
weekly full + daily diff24 h12.0 h9.46 h568.0
daily full24 h12.0 h8.25 h2800.0
weekly full + hourly incr1 h0.5 h51.11 h455.7
wk full, day diff, hr incr1 h0.5 h15.36 h621.7
steps in the longest chain: hourly incr 168, diff + hourly 25
Show the full program
# Chapter 4. p41: snapshot schedules - worst data loss (RPO) and worst
# restore time (RTO) from an off-site copy.
# Model: a 400 GB data set changes 8 GB a day, spread evenly over hours.
# Off-site restore moves 50 GB an hour; every snapshot in a restore
# chain adds 0.25 h of fixed overhead (fetch, verify, mount, apply).
# Incremental = changes since the previous snapshot; differential =
# changes since the last full. Worst case = failure just before the
# next snapshot, restoring the longest chain. All sizes illustrative.
import math

SIZE, DAY, RATE, OVER = 400.0, 8.0, 50.0, 0.25
HOUR = DAY / 24.0


def chain_time(parts):
    # parts = sizes in GB of every snapshot that must be applied
    return math.fsum([p / RATE + OVER for p in parts])


def schedules():
    yield ("weekly full only", 168, [SIZE], SIZE)
    yield ("weekly full + daily incr", 24,
           [SIZE] + [DAY] * 6, SIZE + 6 * DAY)
    yield ("weekly full + daily diff", 24,
           [SIZE, 6 * DAY], SIZE + DAY * 21)
    yield ("daily full", 24, [SIZE], 7 * SIZE)
    yield ("weekly full + hourly incr", 1,
           [SIZE] + [HOUR] * 167, SIZE + 167 * HOUR)
    yield ("wk full, day diff, hr incr", 1,
           [SIZE, 6 * DAY] + [HOUR] * 23,
           SIZE + DAY * 21 + 7 * 23 * HOUR)


print("data %.0f GB, change %.0f GB/day, restore %.0f GB/h, "
      "%.2f h per step" % (SIZE, DAY, RATE, OVER))
print("schedule                   RPO max  RPO mean  RTO max  GB/week")
for name, rpo, parts, store in schedules():
    print("%-26s %6d h %7.1f h %6.2f h %8.1f"
          % (name, rpo, rpo / 2.0, chain_time(parts), store))
print("steps in the longest chain: hourly incr %d, diff + hourly %d"
      % (1 + 167, 2 + 23))

Single source and citation

Fan, Y. (2026). Disaster Recovery for Digital Assets: Shamir Secret-Sharing Thresholds, Off-Site Incremental Snapshots and Self-Rescue from Single Points of Loss (Version 1.0.0), Chapter 4: Off-Site Incremental Snapshots: Recovery Point, Recovery Time and Mean Time to Data Loss. 5D Library. DOI pending

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

BibTeX
@book{fan2026272,
  author    = {Fan, Yafu},
  title     = {Disaster Recovery for Digital Assets: Shamir Secret-Sharing Thresholds, Off-Site Incremental Snapshots and Self-Rescue from Single Points of Loss},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book