What does Pruning a Domain Portfolio conclude, in numbers, about “A Finite-Horizon Lattice: Renewing, Lapsing and Building Year by Year”?
Answer: Part A places the perpetual boundaries of Chapter 1 in the dimension of time. With one year left, the lower boundary is as high as 3,052 and the upper boundary as low as 10,692. With two years left they are 2,157 and 11,844; with five, 1,303 and 13,807; with ten, 918 and 14,802; and with forty, 665 and 15,397, close to the perpetual values of 599 and 16,849 from Chapter 1.
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: 10692, 11844, 1303, 13807, 14802, 15397
| A. boundaries by horizon left, fee 15, 4 steps a year | |
| years drop L build H | |
| 1 | 3,052 10,692 |
| 2 | 2,157 11,844 |
| 3 | 1,693 12,772 |
| 5 | 1,303 13,807 |
| 10 | 918 14,802 |
| 20 | 719 15,287 |
| 40 | 665 15,397 |
| B. 40-year boundaries by fee | |
| fee | 12: L 577, H 15,488 |
| fee | 35: L 1,135, H 14,815 |
| fee | 60: L 1,583, H 14,135 |
Show the full program
# Chapter 3. p32: drop and build boundaries by years of horizon left.
# Model: the lattice of p31 with 4 steps a year. For each horizon the
# drop boundary is the lowest V at which renewing is worth more than 0
# and the build boundary is the lowest V at which building now beats
# waiting; both found by bisection on V. The perpetual boundaries of
# p12 (fee 15: L = 599, H = 16,849) are the long-horizon limit.
# Parameters illustrative (r 0.08, y 0.06, s 0.35, K 6,000).
import math
def root(v0, c, k, years, steps=4, r=0.08, y=0.06, s=0.35):
dt = 1.0 / steps
n = years * steps
u = math.exp(s * math.sqrt(dt))
d = 1 / u
q = (math.exp((r - y) * dt) - d) / (u - d)
disc = math.exp(-r * dt)
w = [max(v0 * u ** j * d ** (n - j) - k, 0.0) for j in range(n + 1)]
cont = 0.0
for t in range(n - 1, -1, -1):
new = []
for j in range(t + 1):
v = v0 * u ** j * d ** (t - j)
cont = -c * dt + disc * (q * w[j + 1] + (1 - q) * w[j])
new.append(max(0.0, v - k, cont))
w = new
return w[0], cont
def boundary(test, lo, hi):
for _ in range(40):
mid = (lo + hi) / 2
if test(mid):
hi = mid
else:
lo = mid
return hi
if __name__ == "__main__":
k = 6000
print("A. boundaries by horizon left, fee 15, 4 steps a year")
print(" years drop L build H")
for yrs in (1, 2, 3, 5, 10, 20, 40):
low = boundary(lambda v: root(v, 15, k, yrs)[1] > 0, 1, 20000)
high = boundary(lambda v: v - k >= root(v, 15, k, yrs)[1],
k, 40000)
print(" {:>5} {:>7,.0f} {:>8,.0f}".format(yrs, low, high))
print("B. 40-year boundaries by fee")
for c in (12, 35, 60):
low = boundary(lambda v: root(v, c, k, 40)[1] > 0, 1, 20000)
high = boundary(lambda v: v - k >= root(v, c, k, 40)[1],
k, 40000)
print(" fee {:>3}: L {:>6,.0f}, H {:>7,.0f}".format(c, low, high))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 3: A Finite-Horizon Lattice: Renewing, Lapsing and Building Year by Year. 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
- Chapter 1 · Carrying Cost and the Development Option: the Value of Waiting, Renewal Fees and Two Boundaries
- Chapter 2 · The Price Evidence: Repeat-Sales Indices, Survivorship Bias and the Cost of Holding
- Chapter 4 · Pruning under a Budget: the Knapsack, the Greedy Ratio and a Ten-Year Back-Test of Policies
- Chapter 5 · Rank, Clicks and Direct Navigation: Where the Moat of a Geo-Exact Name Comes From
- Chapter 6 · Generative Search and Entity Consistency: Only Structured Data that Visitors Can See
- Chapter 7 · Classics East and West: Bai Gui's "Take What Others Discard" and Henry George on Land Speculation
- Chapter 8 · The Annual Renewal Audit and a Plan for Refutation