What does Paywall Recall and Upsell Ratchets conclude, in numbers, about “The Red Lines of Unsubscription and Complaint: A Stopping Rule, a Complaint Brake and the Consent Law of Three Jurisdictions”?

Answer: With a true rate of 0.0006, 1,000 messages a week touch the line in 0.451 of weeks; at 7,000 the chance of touching the brake is 0.247 and of touching the 0.10 % line 0.132; at 35,000 the chances are 0.082 and 0.003. With a true rate of 0.0012 the list itself is already over the 0.10 % line: at 7,000 messages a week, 0.843 of weeks touch the brake and 0.733 touch the 0.10 % line; at 35,000 the figures are 0.991 and 0.879. Here the brake is not giving a false alarm; it is reporting the truth.

Scope of the numbers: The site is treated as a paid report product, with no claim of predictive accuracy and no fear; all visitor and order data are synthetic or illustrative. Marked boxes separate published evidence, runnable Python calculations (25 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.0006, 0.0012, 0.003, 0.082, 0.10, 0.132

A. chance that one week's observed rate reaches a line, by weekly sends
true rate sends/week >= brake 0.08 % >0.10 % >= 0.30 %
0.00031,000 0.259 0.259 0.004
0.00037,000 0.020 0.006 0.000
0.000335,000 0.000 0.000 0.000
0.00061,000 0.451 0.451 0.023
0.00067,000 0.247 0.132 0.000
0.000635,000 0.082 0.003 0.000
0.00121,000 0.699 0.699 0.120
0.00127,000 0.843 0.733 0.000
0.001235,000 0.991 0.879 0.000
B. zero complaints observed: one-sided 95 % upper bound 1 - 0.05^(1/n)
n300: bound 0.00994
n1,000: bound 0.00299
n3,000: bound 0.00100
n10,000: bound 0.00030
sends needed before a clean record shows the rate is below 0.10 %2,995
Show the full program
# Chapter 4. p42: complaint-rate brake against the published Gmail lines.
# Google's sender guidelines ask bulk senders to keep the spam rate in
# Postmaster Tools below 0.10 % and never to reach 0.30 %. Internal brake
# (this book's rule): pause all recall waves when the 7-day complaint
# rate reaches 0.08 %. Binomial arithmetic, exact tails; send volumes
# and true rates are illustrative.
import math

LINE_SOFT, LINE_HARD, BRAKE = 0.0010, 0.0030, 0.0008


def tail_ge(n, p, k):
    # P(X >= k) for X ~ Binomial(n, p), summed in log space
    if k <= 0:
        return 1.0
    terms = []
    for x in range(k, n + 1):
        lt = (math.lgamma(n + 1) - math.lgamma(x + 1) - math.lgamma(n - x + 1)
              + x * math.log(p) + (n - x) * math.log1p(-p))
        if lt < -60 and x > n * p:
            break
        terms.append(math.exp(lt))
    return math.fsum(terms)


if __name__ == "__main__":
    print("A. chance that one week's observed rate reaches a line, by weekly sends")
    print("   true rate   sends/week   >= brake 0.08 %   >= 0.10 %   >= 0.30 %")
    for p in (0.0003, 0.0006, 0.0012):
        for n in (1000, 7000, 35000):
            kb = math.ceil(BRAKE * n)
            ks = math.ceil(LINE_SOFT * n)
            kh = math.ceil(LINE_HARD * n)
            print("   {:.4f}      {:>6,}       {:.3f}             {:.3f}       {:.3f}".format(
                p, n, tail_ge(n, p, kb), tail_ge(n, p, ks), tail_ge(n, p, kh)))
    print("B. zero complaints observed: one-sided 95 % upper bound 1 - 0.05^(1/n)")
    for n in (300, 1000, 3000, 10000):
        print("   n = {:>6,}: bound {:.5f}".format(n, 1.0 - 0.05 ** (1.0 / n)))
    n = 1
    while 1.0 - 0.05 ** (1.0 / n) >= LINE_SOFT:
        n = n + 1
    print("   sends needed before a clean record shows the rate is below 0.10 %: {:,}".format(n))

Single source and citation

Fan, Y. (2026). Paywall Abandonment Recovery Timing, Personalised Curiosity Recall and High-Ticket Upsell Ratchets (Version 1.0.0), Chapter 4: The Red Lines of Unsubscription and Complaint: A Stopping Rule, a Complaint Brake and the Consent Law of Three Jurisdictions. 5D Library. DOI pending

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

BibTeX
@book{fan2026349,
  author    = {Fan, Yafu},
  title     = {Paywall Abandonment Recovery Timing, Personalised Curiosity Recall and High-Ticket Upsell Ratchets},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book