What does Red-Blue Synthetic-Customer Sandboxes conclude, in numbers, about “The Leak Discovery Curve: Unseen Probability, Species Estimates and Stopping Rules”?

Answer: Chapter 5 draws the leak discovery curve and derives stopping rules from Good's estimate and Chao's lower bound; 24 clean buyers bound the leak rate no lower than 0.1173.

Scope of the numbers: Parameters are illustrative; all calculations are generated by the book's programs, which call no model interface. This is not individual business advice.

中文版

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: 24

modes 40; largest rate 0.150; smallest 0.00259
nmodes seensharemissing mass
62.880.0720.40049
248.420.2110.24178
4813.290.3320.17034
9619.780.4940.10753
19227.300.6820.05680
38434.230.8560.02209
76838.530.9630.00494
153639.870.9970.00039
buyers to expect 50 per cent of modes: 99
buyers to expect 80 per cent of modes: 302
buyers to expect 90 per cent of modes: 483
modes one random buyer trips on average: 0.552
Show the full program
# Chapter 5. p51: the failure-mode discovery curve.
# 40 leak modes (illustrative) with Zipf-like trigger rates per
# synthetic buyer, p_i = 0.15 / i^1.1. After n independent buyers the
# expected number of modes seen is E(n) = sum_i [1 - (1 - p_i)^n] and
# the chance that the next buyer trips a mode not yet seen (missing
# mass) is M(n) = sum_i p_i (1 - p_i)^n. Sums use math.fsum.
import math

K = 40
P = [0.15 / i ** 1.1 for i in range(1, K + 1)]


def seen(n):
    return math.fsum(1 - (1 - p) ** n for p in P)


def missing(n):
    return math.fsum(p * (1 - p) ** n for p in P)


print("modes %d; largest rate %.3f; smallest %.5f" % (K, P[0], P[-1]))
print("    n   modes seen   share   missing mass")
for n in (6, 24, 48, 96, 192, 384, 768, 1536):
    e = seen(n)
    print("%5d   %9.2f    %.3f   %.5f" % (n, e, e / K, missing(n)))
for goal in (0.5, 0.8, 0.9):
    n = 1
    while seen(n) < goal * K:
        n += 1
    print("buyers to expect %.0f per cent of modes: %d"
          % (goal * 100, n))
print("modes one random buyer trips on average: %.3f" % seen(1))

Single source and citation

Fan, Y. (2026). Red-Blue Synthetic-Customer Sandboxes: Multi-Round Bargaining against Parameterised Demanding Buyers and Pre-Launch Leak Detection (Version 1.0.0), Chapter 5: The Leak Discovery Curve: Unseen Probability, Species Estimates and Stopping Rules. 5D Library. DOI pending

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

BibTeX
@book{fan2026259,
  author    = {Fan, Yafu},
  title     = {Red-Blue Synthetic-Customer Sandboxes: Multi-Round Bargaining against Parameterised Demanding Buyers and Pre-Launch Leak Detection},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book