What does Seven-Day Ignition and Firepower Concentration conclude, in numbers, about “Trial Firing and Culling: Which Knives to Try First, and When to Change”?

Answer: Chapter 5 shows that committing after day one picks the best knife with probability 0.550.

Scope of the numbers: Its parameters are illustrative and prices are in illustrative units without currency; all calculations are generated by its programs; it is not individual business advice and promises no income. Chapter 2 defines the firepower concentration ratio; in an illustrative catalog pushing only the top three earns 0.805 of the optimum.

中文版

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

A. buyers in 7 days (mean of 200 runs); oracle = 147.0
policymeanp10p90best_last_daybest_weekP(top=best)
uniform83.272940.1200.1200.000
commit118.7861470.5490.4540.550
commit2115.9931340.6310.4430.640
thompson107.7901240.4920.3450.715
Show the full program
# Chapter 5. p51: trial-firing eight candidate knives for seven days
# Eight candidates with true conversion rates from 0.010 to 0.035
# (illustrative), 600 visitors a day for 7 days, traffic assigned in
# batches of 50. Policies: uniform split; explore day 1 (or days 1-2) then
# commit to the leader; batch Thompson sampling (Beta(1,1) priors, traffic in
# proportion to how often each arm wins 20 posterior draws). 200 runs.
import math
import random
import statistics

rng = random.Random(41551)
P = (0.010, 0.012, 0.015, 0.018, 0.020, 0.024, 0.028, 0.035)
DAY, DAYS, BATCH, RUNS = 600, 7, 50, 200
NB = DAY * DAYS // BATCH


def serve(arm, n):
    k = 0
    for _ in range(n):
        if rng.random() < P[arm]:
            k += 1
    return k


def split(weights, n):
    # integer weights -> integer traffic, largest remainders first
    tot = int(math.fsum(weights))
    raw = [n * v / tot for v in weights]
    out = [int(r) for r in raw]
    left = n - int(math.fsum(out))
    order = sorted(range(len(weights)),
                   key=lambda i: (-(raw[i] - out[i]), i))
    for i in order[:left]:
        out[i] += 1
    return out


def run(policy):
    succ = [0] * 8
    tri = [0] * 8
    last_day = [0] * 8
    buyers = 0
    for b in range(NB):
        explore = NB // DAYS * (2 if policy == "commit2" else 1)
        if policy == "uniform" or (policy.startswith("commit")
                                   and b < explore):
            alloc = split([1] * 8, BATCH)
        elif policy.startswith("commit"):
            lead = max(range(8), key=lambda i: (succ[i] / max(1, tri[i]), -i))
            alloc = [BATCH if i == lead else 0 for i in range(8)]
        else:
            wins = [0] * 8
            for _ in range(20):
                draws = [rng.betavariate(1 + succ[i], 1 + tri[i] - succ[i])
                         for i in range(8)]
                wins[max(range(8), key=lambda i: draws[i])] += 1
            alloc = split(wins, BATCH)
        for i in range(8):
            if alloc[i]:
                k = serve(i, alloc[i])
                succ[i] += k
                tri[i] += alloc[i]
                buyers += k
                if b >= NB - NB // DAYS:
                    last_day[i] += alloc[i]
    top = max(range(8), key=lambda i: (last_day[i], i))
    return (buyers, last_day[7] / float(DAY), tri[7] / float(DAY * DAYS),
            1.0 if top == 7 else 0.0)


oracle = DAY * DAYS * P[7]
print("A. buyers in 7 days (mean of {} runs); oracle = {:.1f}".format(
    RUNS, oracle))
print("policy    mean   p10  p90  best_last_day  best_week  P(top=best)")
for pol in ("uniform", "commit", "commit2", "thompson"):
    res = [run(pol) for _ in range(RUNS)]
    b = sorted(r[0] for r in res)
    print("{:<8} {:6.1f}  {:4d} {:4d}  {:13.3f}  {:9.3f}  {:11.3f}".format(
        pol, statistics.fmean(b), b[RUNS // 10], b[RUNS * 9 // 10],
        statistics.fmean(r[1] for r in res),
        statistics.fmean(r[2] for r in res),
        statistics.fmean(r[3] for r in res)))

Single source and citation

Fan, Y. (2026). Seven-Day Cashflow Ignition from Large Digital Asset Catalogs: Firepower Concentration Ratios and Saturation Monetisation Sprints (Version 1.0.0), Chapter 5: Trial Firing and Culling: Which Knives to Try First, and When to Change. 5D Library. DOI pending

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

BibTeX
@book{fan2026415,
  author    = {Fan, Yafu},
  title     = {Seven-Day Cashflow Ignition from Large Digital Asset Catalogs: Firepower Concentration Ratios and Saturation Monetisation Sprints},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book