What does Pruning a Domain Portfolio conclude, in numbers, about “The Annual Renewal Audit and a Plan for Refutation”?

Answer: Chapter 8 gives the annual renewal audit, the distilled Domain Pool Renewal Pruner and a pre-registered plan of refutation: the test of the lapse rule needs 52 released names and is refuted if 6 cross the line. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.

Scope of the numbers: Chapter 2 examines the price evidence: in the illustrative model a repeat-sales estimate is biased upwards by 0.1284, and applying the index's growth of 0.0723 a year leads to systematic under-pruning. Marked boxes separate published evidence, runnable Python calculations (20 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: 52

T1. dropped names needed52; refute if 6 or more
exceed the line (alpha 0.0445, power 0.8119)
at 12 drops a year5 audit years
at 23 drops a year3 audit years
at 40 drops a year2 audit years
T2. built sites needed14 (shift 0.08, sd 0.12)
T3. CTR match test3,837 impressions per arm at u = 0.20
Show the full program
# Chapter 8. p82: sample sizes for the pre-registered tests.
# Test 1 (pruning): among names the audit drops, the share that within
# twelve months draw an offer above ten years of their fees, or are
# re-registered and built by someone else, is at most 0.05. Exact
# one-sided binomial test, alpha 0.05, power 0.80 against 0.15.
# Test 2 (moat): the rank-independent share of visits (direct plus
# branded) on built geo-exact sites is at least 0.25; one-sided t
# approximation, sd 0.12 between sites, detect a true share of 0.17.
# Test 3 (no EMD bonus): see p53. All targets illustrative.
import math
from statistics import NormalDist

Z = NormalDist()


def binom_tail(n, k, p):
    terms = [math.comb(n, j) * p ** j * (1 - p) ** (n - j)
             for j in range(k, n + 1)]
    return math.fsum(terms)


def exact_n(p0, p1, alpha=0.05, power=0.80):
    for n in range(5, 2000):
        k = 0
        while binom_tail(n, k, p0) > alpha:
            k += 1
        if binom_tail(n, k, p1) >= power:
            return n, k
    return None


if __name__ == "__main__":
    n, k = exact_n(0.05, 0.15)
    print("T1. dropped names needed: {}; refute if {} or more".format(
        n, k))
    print("    exceed the line (alpha {:.4f}, power {:.4f})".format(
        binom_tail(n, k, 0.05), binom_tail(n, k, 0.15)))
    for per_year in (12, 23, 40):
        print("    at {:>2} drops a year: {} audit years".format(
            per_year, math.ceil(n / per_year)))
    za, zb = Z.inv_cdf(0.95), Z.inv_cdf(0.80)
    sites = math.ceil(((za + zb) * 0.12 / (0.25 - 0.17)) ** 2)
    print("T2. built sites needed: {} (shift 0.08, sd 0.12)".format(sites))
    print("T3. CTR match test: 3,837 impressions per arm at u = 0.20")

Single source and citation

Fan, Y. (2026). Real-Options Valuation of Geo-Exact Domain Portfolios, Optimal Renewal Pruning and the Moats of Organic Search (Version 1.0.0), Chapter 8: The Annual Renewal Audit and a Plan for Refutation. 5D Library. DOI pending

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

BibTeX
@book{fan2026341,
  author    = {Fan, Yafu},
  title     = {Real-Options Valuation of Geo-Exact Domain Portfolios, Optimal Renewal Pruning and the Moats of Organic Search},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book