What does Zero-Ticket Interfaces and Self-Service State Machines conclude, in numbers, about “One Timed Self-Service Recompute: Window Length, Precision Stamps and Misuse”?

Answer: Chapter 5 finds that one self-service recompute within 24 hours catches 0.981 of genuine errors while keeping precision stamps and never filling in a birth time, eliminating 0.754 of wrong-input tickets.

Scope of the numbers: Parameters are illustrative and all calculations come from the book's programs; the book is general business analysis, not individual or legal advice. Marked boxes separate published evidence, runnable Python calculations (22 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: 0.981, 24

window_hgenuine_inmisuse_inhuman_leftcost
10.2820.00139.5040.32
60.8200.0089.9012.41
240.9810.0331.064.77
720.9990.1000.085.87
1681.0000.2330.019.87
7201.0001.0000.0033.25
lowest cost window 24 h, cost 4.77
72 h window if log-sd were 0.8: genuine covered 1.000
72 h window if log-sd were 1.6: genuine covered 0.987
Show the full program
# Chapter 5. p51: how long the one-time recompute window should stay open
# Genuine input errors are noticed after a lognormal delay (median 2 h,
# log-sd 1.2); misuse attempts (using the free recompute to get a report
# for someone else) arrive uniformly over 30 days. Per month: 55 genuine
# errors (p11), 10 misuse attempts. Cost in ticket-equivalents: 1 per
# genuine error left to a human, 3 per misuse let through, 0.05 per
# recompute run. All parameters illustrative.
import math
from statistics import NormalDist

Z = NormalDist()
MED, SIG = 2.0, 1.2
GENUINE, MISUSE = 55, 10


def covered(w):
    return Z.cdf((math.log(w) - math.log(MED)) / SIG)


print("window_h  genuine_in  misuse_in  human_left  cost")
best = None
for w in (1, 6, 24, 72, 168, 720):
    g = covered(w)
    m = min(1.0, w / 720.0)
    human = GENUINE * (1 - g)
    cost = math.fsum([human, 3 * MISUSE * m,
                      0.05 * (GENUINE * g + MISUSE * m)])
    if best is None or cost < best[0]:
        best = (cost, w)
    print("{:>8}  {:>10.3f}  {:>9.3f}  {:>10.2f}  {:>5.2f}".format(
        w, g, m, human, cost))
print("lowest cost window {} h, cost {:.2f}".format(best[1], best[0]))
for sig in (0.8, 1.6):
    g = Z.cdf((math.log(72) - math.log(MED)) / sig)
    print("72 h window if log-sd were {:.1f}: genuine covered {:.3f}"
          .format(sig, g))

Single source and citation

Fan, Y. (2026). Zero-Ticket Self-Repairing Order Interfaces, Self-Service Correction State Machines and Pre-Emptive Support Elimination (Version 1.0.0), Chapter 5: One Timed Self-Service Recompute: Window Length, Precision Stamps and Misuse. 5D Library. DOI pending

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

BibTeX
@book{fan2026401,
  author    = {Fan, Yafu},
  title     = {Zero-Ticket Self-Repairing Order Interfaces, Self-Service Correction State Machines and Pre-Emptive Support Elimination},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book