What does Bootstrap Cashflow and Kill-Switch Lights conclude, in numbers, about “Sequential Boundaries in Seventy-Two Hours: Wald's Test and the Price of Peeking”?

Answer: Seventy-two hours are not a moment of decision but a hard cap. The real decision comes from Wald's boundaries. With the parameters of this chapter, clearly good and clearly bad ads are decided in about 16 hours on average, almost half the time a fixed-sample test needs. Adding the seventy-two-hour cap barely affects the power of the test; only tests near break-even run into the cap, and they are closed as planned. Conversely, peeking every hour with a fixed threshold declares an ad with no advantage a winner 0.325 of the time, and running a bad ad for the full fourteen days loses almost five times as much as closing it at seventy-two hours.

Scope of the numbers: The north star becomes daily net cash banked (cash received minus real outlays minus the refund reserve); in a fixed-seed synthetic ledger, revenue grows by a factor of 4.05 while net cash banked keeps sinking. Parameters are illustrative; all figures come from the book's programs.

中文版

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.325

plantrue pfalse-win ratemean hour of win
one look at 72 h0.0150.00172.0
hourly, 72 h0.0150.1134.5
hourly, 14 days0.0150.1184.4
one look at 72 h0.0200.06072.0
hourly, 72 h0.0200.32513.5
hourly, 14 days0.0200.41944.9
expected net of a p = 0.015 ad run 14 days = -2,520
expected net of the same ad cut at 72 hours = -540
Show the full program
# Chapter 3. p33: peeking every hour inflates false wins.
# Naive rule: every hour, test orders against break-even conversion
# 0.02 with a one-sided z-test at the 5 % level, and call the ad a
# winner the first hour z > 1.645. Compare one look at 72 hours, hourly
# looks for 72 hours, and "give it time": hourly looks for 14 days.
# True p = 0.015 (a loser) and 0.020 (break-even: no real edge). 25
# clicks an hour, CPC 1.2, contribution 60 (illustrative). 10,000
# tests per row, fixed seed; orders arrive by geometric gaps.
import math
import random

P_BE, RATE, CPC, CONTRIB = 0.02, 25, 1.2, 60.0
Z = 1.6449
TRIALS = 10000


def hourly_orders(p, hours, rng):
    counts = [0] * hours
    lq = math.log(1.0 - p)
    pos = 0
    while True:
        pos += int(math.log(1.0 - rng.random()) / lq) + 1
        h = (pos - 1) // RATE
        if h >= hours:
            return counts
        counts[h] += 1


def first_win(counts, looks):
    k = 0
    for h in range(len(counts)):
        k += counts[h]
        if h + 1 in looks:
            n = (h + 1) * RATE
            z = (k - n * P_BE) / math.sqrt(n * P_BE * (1.0 - P_BE))
            if z > Z:
                return h + 1
    return None


if __name__ == "__main__":
    rng = random.Random(20261120)
    plans = [("one look at 72 h", 72, {72}),
             ("hourly, 72 h", 72, set(range(1, 73))),
             ("hourly, 14 days", 336, set(range(1, 337)))]
    print("plan               true p  false-win rate  mean hour of win")
    for p in (0.015, 0.020):
        for name, hours, looks in plans:
            wins, when = 0, []
            for _ in range(TRIALS):
                c = hourly_orders(p, hours, rng)
                w = first_win(c, looks)
                if w is not None:
                    wins += 1
                    when.append(w)
            mh = math.fsum(when) / len(when) if when else 0.0
            print("  {:<17} {:.3f}  {:>14.3f}  {:>16.1f}".format(
                name, p, wins / TRIALS, mh))
    loss = (0.015 * CONTRIB - CPC) * 336 * RATE
    print("expected net of a p = 0.015 ad run 14 days = {:,.0f}".format(
        loss))
    print("expected net of the same ad cut at 72 hours = {:,.0f}".format(
        (0.015 * CONTRIB - CPC) * 72 * RATE))

Single source and citation

Fan, Y. (2026). Bootstrap Cashflow Discipline, Seventy-Two-Hour Kill-Switch Dashboards and Reinvestment Compounding to Five Thousand Daily (Version 1.0.0), Chapter 3: Sequential Boundaries in Seventy-Two Hours: Wald's Test and the Price of Peeking. 5D Library. DOI pending

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

BibTeX
@book{fan2026372,
  author    = {Fan, Yafu},
  title     = {Bootstrap Cashflow Discipline, Seventy-Two-Hour Kill-Switch Dashboards and Reinvestment Compounding to Five Thousand Daily},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book