关于「年度续费审计闭环与证伪方案」,《域名池续费剪枝》给出的定量结论是什么?
结论:第八章给出年度续费审计、蒸馏小工具「域名池续费剪枝器」与预注册证伪方案:放手规则的检验需要 52 枚放手名字,6 枚越线即推翻。书中以标注框区分已发表的证据、可运行的 Python 计算(20 段程序)、原典与作者的假说。
数据口径:示意参数下,触发倍数为 2.893,续费 15 时下边界为 599、上边界为 16,849;42 枚示意名字里有 23 枚应当弃续,期权部分占最优价值的 0.861,合理续费只需全额 1,340 中的一小部分。 核对原文之后,本书做了蓝图修正:2012 年的精确匹配域名更新针对的是低质量网站,名字不带排名加成只是稳健性假定;林登塔尔的重复交易指数只反映成交过的名字;不依赖排名的访问在示意参数下约占 0.309,是可靠的地板而不是流量的大头。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 52
| T1. dropped names needed | 52; refute if 6 or more |
| exceed the line (alpha 0.0445, power 0.8119) | |
| at 12 drops a year | 5 audit years |
| at 23 drops a year | 3 audit years |
| at 40 drops a year | 2 audit years |
| T2. built sites needed | 14 (shift 0.08, sd 0.12) |
| T3. CTR match test | 3,837 impressions per arm at u = 0.20 |
查看完整验算程序
# 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")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《精确地域域名实物期权估值、续费剪枝最优停时与自然搜索垄断护城河母典》第 8 章「年度续费审计闭环与证伪方案」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}