What does Zero-Ticket Interfaces and Self-Service State Machines conclude, in numbers, about “Abuse Limits and Rebind Verification: Stopping Scripts Without Stopping People”?
Answer: Chapter 4 compares three attempt limits; merging repeats within twenty minutes nearly ends harm to genuine users, and verifying the holder with receipt evidence keeps hijacks near 0.0182 a year.
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.0182
genuine typo rebinds per year 477 level hijacks/yr self-served to human L0 none 36.5000 477 0 L1 code to old address 0.0002 0 477 L2 receipt proof 0.0182 406 72 L1 sends the code to the mistyped address itself: a stranger may own it, so L1 both fails the genuine user and leaks. L2: chance of at least one hijack in a year 0.0183
Show the full program
# Chapter 4. p43: verifying the holder before a rebind
# 36,500 orders a year (100 a day). An outsider who has learned an
# order number tries to move delivery to his own address on a share
# 0.001 of orders. Genuine rebind requests: 0.4 of not-received tickets
# (p11 share 0.268 of 12.20 tickets per 100 orders) are typo addresses.
# Proof levels and their guess spaces are illustrative.
import math
ORDERS = 36500
ATTEMPT = 0.001
TRIES = 5
typo = ORDERS * 0.122 * 0.268 * 0.4
LEVELS = [
# name, outsider success per attempt, genuine self-serve share
("L0 none", 1.0, 1.0),
("L1 code to old address", TRIES / 10 ** 6, 0.0),
("L2 receipt proof", TRIES / 10 ** 4, 0.85),
]
print("genuine typo rebinds per year {:.0f}".format(typo))
print("level hijacks/yr self-served to human")
for name, p, selfs in LEVELS:
hij = ORDERS * ATTEMPT * p
print("{:<24} {:>10.4f} {:>11.0f} {:>8.0f}".format(
name, hij, typo * selfs, typo * (1 - selfs)))
print("L1 sends the code to the mistyped address itself: a stranger")
print("may own it, so L1 both fails the genuine user and leaks.")
p_any = 1 - (1 - TRIES / 10 ** 4) ** math.ceil(ORDERS * ATTEMPT)
print("L2: chance of at least one hijack in a year {:.4f}".format(p_any))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 4: Abuse Limits and Rebind Verification: Stopping Scripts Without Stopping People. 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
- Chapter 1 · Root-Cause Clustering of Tickets: What a Month of After-Sale Messages Is Made Of
- Chapter 2 · The Ceiling on Elimination: Class Share Times Self-Service Completion
- Chapter 3 · The Self-Service Correction State Machine: Guards, Idempotency and Exhaustive Checking
- Chapter 5 · One Timed Self-Service Recompute: Window Length, Precision Stamps and Misuse
- Chapter 6 · Progress Transparency and the Residual Human Desk: a Chase Model and Erlang C
- Chapter 7 · Classical Sources East and West: the Ant Hole and the Division of Mental Labour
- Chapter 8 · The Empirical Loop: Field Tools and Checker Specifications