What does Acquirer Risk Steps and Reserve Survival conclude, in numbers, about “Lag: Cohort Measures, Arrival-Date Measures and Underestimation During Surges”?
Answer: Chapter 2 shows that late-arriving disputes push an arrival-date ratio as low as 35.5 % of the true rate during a surge and up to 1.2622 % after a twenty-day campaign, and pulls the estimate back with a reporting-delay adjustment.
Scope of the numbers: Parameters are illustrative; all calculations come from the book's programs. This is general risk analysis, not legal, financing or investment advice, and promises no income.
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: 35.5
| mean lag 36.2 days; P(lag <= 30) 0.4575; P(lag <= 60) 0.8778 | ||||
| day | payments | arrival 30d | prior-month | cohort |
| 60 | 1,000 | 0.5000% | 0.5000% | 0.5000% |
| 75 | 3,000 | 0.3290% | 0.5045% | 0.5000% |
| 90 | 5,000 | 0.1903% | 0.5835% | 0.5000% |
| 105 | 5,000 | 0.1940% | 0.5734% | 0.5000% |
| 120 | 5,000 | 0.2767% | 0.4512% | 0.5000% |
| 135 | 5,000 | 0.3753% | 0.4139% | 0.5000% |
| 150 | 5,000 | 0.4405% | 0.4405% | 0.5000% |
| 165 | 5,000 | 0.4747% | 0.4747% | 0.5000% |
| 180 | 5,000 | 0.4904% | 0.4904% | 0.5000% |
| lowest arrival 30d ratio 0.1774% on day 96; it reads 35.5% of the true rate |
Key formula
Show the full program
# Chapter 2. p21: arrival-day ratios understate the true rate in a surge.
# Every payment has the same true dispute rate P = 0.5 %, but a dispute
# arrives d days after the payment, d following a discretised Erlang law
# (shape 3, scale 12 days, mean about 36 days, cut at 120 days).
# Volume: 1,000 payments a day for 60 days, a linear ramp to 5,000 a
# day over days 61 to 90, then 5,000 a day to day 180.
# Three ratios, all from expected counts (no noise):
# arrival 30d = disputes arriving in the last 30 days / payments in
# the last 30 days (the ratio most dashboards show);
# prior-month = disputes arriving in a 30-day month / payments in the
# month before (a lagged-denominator ratio);
# cohort = disputes eventually charged to a payment day / its
# payments, which is P by construction.
# All numbers illustrative.
import math
P = 0.005
SHAPE, SCALE, CUT = 3, 12.0, 120
DAYS = 180
def erlang_cdf(x):
if x <= 0:
return 0.0
y = x / SCALE
terms = [y ** i / math.factorial(i) for i in range(SHAPE)]
return 1.0 - math.exp(-y) * math.fsum(terms)
def lag_pmf():
raw = [erlang_cdf(d) - erlang_cdf(d - 1) for d in range(1, CUT + 1)]
tot = math.fsum(raw)
return [r / tot for r in raw]
def volume(t):
if t <= 60:
return 1000.0
if t <= 90:
return 1000.0 + 4000.0 * (t - 60) / 30.0
return 5000.0
def arrivals(pmf):
"""expected disputes arriving on days 1..DAYS; the shop ran at
1,000 a day for a long time before day 1"""
out = []
for t in range(1, DAYS + 1):
terms = [volume(t - d) * P * pmf[d - 1] for d in range(1, CUT + 1)]
out.append(math.fsum(terms))
return out
def main():
pmf = lag_pmf()
mean_lag = math.fsum([d * q for d, q in zip(range(1, CUT + 1), pmf)])
vol = [volume(t) for t in range(1, DAYS + 1)]
arr = arrivals(pmf)
print("mean lag {:.1f} days; P(lag <= 30) {:.4f}; P(lag <= 60) "
"{:.4f}".format(mean_lag, math.fsum(pmf[:30]),
math.fsum(pmf[:60])))
print(" day payments arrival 30d prior-month cohort")
worst = (1.0, 0)
for t in range(60, DAYS + 1):
a30 = math.fsum(arr[t - 30:t]) / math.fsum(vol[t - 30:t])
if a30 < worst[0]:
worst = (a30, t)
if t % 15 == 0:
pm = math.fsum(arr[t - 30:t]) / math.fsum(vol[t - 60:t - 30])
print("{:>4} {:>9,.0f} {:.4%} {:.4%} {:.4%}".format(
t, vol[t - 1], a30, pm, P))
print("lowest arrival 30d ratio {:.4%} on day {}; it reads {:.1%}"
" of the true rate".format(worst[0], worst[1], worst[0] / P))
if __name__ == "__main__":
main()Single source and citation
Fan, Y. (2026). Payment-Acquirer Risk Step-Functions, Multi-Gateway Hot Failover and Rolling-Reserve Survival for Digital Fleets (Version 1.0.0), Chapter 2: Lag: Cohort Measures, Arrival-Date Measures and Underestimation During Surges. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-397 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026397,
author = {Fan, Yafu},
title = {Payment-Acquirer Risk Step-Functions, Multi-Gateway Hot Failover and Rolling-Reserve Survival for Digital Fleets},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Steps: Noise in the Chargeback Ratio, the Beta Posterior and Card-Network Definitions
- Chapter 3 · Jumps: Cumulative Sums, Exponentially Weighted Averages and Bayesian Online Change Points
- Chapter 4 · Refunds: The Optimal Interception Threshold Before a Dispute
- Chapter 5 · Hot Failover: Common-Cause Failure, Timeout Budgets and Idempotency
- Chapter 6 · Reserves: Rolling Holdbacks, Settlement Freezes and the Minimum Buffer That Keeps Cash Flowing
- Chapter 7 · Reading the Classics: Peace and Peril in the Zuo Zhuan, Forethought in the Doctrine of the Mean, Joseph's Granaries and Bagehot's Reserve
- Chapter 8 · The Empirical Loop: the Acquirer-Risk Ledger, Field Tools and Checker Specifications