What does Demo-First Closing and 48-Hour Delivery conclude, in numbers, about “How Complete Should a Preview Be? The Saturating Win-Rate Curve, the Optimal Completeness and Preview Compliance”?
Answer: The win rate of a preview rises along a saturating curve, its hours rise along a convex one, and expected net value peaks in between. Under the illustrative parameters the optimal completeness is about 0.289, and a complete preview loses more than no preview at all. The higher the margin, the higher the optimum; the faster the win rate saturates, the earlier the preview should stop. The IKEA effect requires the client's own labour and a finished result, so it cannot be borrowed for half-built previews and must instead be tested as a hypothesis about client participation. Before any client sees a preview, it must pass five checks: source of materials, trademarks, indexing, contrast and tap height.
Scope of the numbers: Its win rates, hours, margins, upfront shares, fees and prices are illustrative, counted in units that match no currency, client or real deal, and all calculations are generated by its programs. It is not legal advice and not individual business or financial advice; contract terms need review by a locally admitted lawyer.
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.289
| k | 4, margin 4,400: x* = 0.289 (grid 0.289) |
| p(x*) | 0.326, hours 4.89, E = 1,139.3 |
| no preview E | 820.0; full preview E = 292.0 |
| gain of x* over no preview | 319.3 units |
| x* by margin (rows) and curvature k (columns) | |
| margin k | 2 k=4 k=8 |
| 2,000 | 0.078 0.148 0.156 |
| 4,400 | 0.292 0.289 0.238 |
| 8,000 | 0.476 0.401 0.301 |
| catalogue hours 15.5; shown working 4.5 -> completeness 0.290 |
Show the full program
# Chapter 2. p21: how complete should the preview be?
# Win rate rises with completeness x in [0, 1] along a saturating curve
# p(x) = p0 + (p1 - p0) * (1 - exp(-k x)) / (1 - exp(-k))
# and preview hours rise convexly: h(x) = 1 + 10 x + 12 x^2.
# Expected net value E(x) = p(x) * M - RATE * h(x). All parameters are
# illustrative (p0 0.20 without preview, p1 0.38 at a full preview).
# The optimum is found on a grid of 0.001 and refined by bisection on
# the derivative; a sensitivity table varies margin M and curvature k.
import math
P0, P1, RATE = 0.20, 0.38, 60
def p_win(x, k):
return P0 + (P1 - P0) * (1 - math.exp(-k * x)) / (1 - math.exp(-k))
def hours(x):
return math.fsum([1.0, 10.0 * x, 12.0 * x * x])
def value(x, k, m):
return p_win(x, k) * m - RATE * hours(x)
def deriv(x, k, m):
dp = (P1 - P0) * k * math.exp(-k * x) / (1 - math.exp(-k))
return dp * m - RATE * (10.0 + 24.0 * x)
def best(k, m):
if deriv(0.0, k, m) <= 0:
return 0.0
if deriv(1.0, k, m) >= 0:
return 1.0
lo, hi = 0.0, 1.0
for _ in range(60):
mid = (lo + hi) / 2
if deriv(mid, k, m) > 0:
lo = mid
else:
hi = mid
return (lo + hi) / 2
K, M = 4.0, 4400
x = best(K, M)
grid = max((value(i / 1000, K, M), i / 1000) for i in range(1001))
print("k = 4, margin 4,400: x* = {:.3f} (grid {:.3f})".format(x, grid[1]))
print(" p(x*) = {:.3f}, hours {:.2f}, E = {:,.1f}".format(
p_win(x, K), hours(x), value(x, K, M)))
print(" no preview E = {:.1f}; full preview E = {:.1f}".format(
value(0.0, K, M), value(1.0, K, M)))
print(" gain of x* over no preview: {:.1f} units".format(
value(x, K, M) - value(0.0, K, M)))
print("x* by margin (rows) and curvature k (columns)")
print(" margin k=2 k=4 k=8")
for m in (2000, 4400, 8000):
cells = ["{:.3f}".format(best(k, m)) for k in (2.0, 4.0, 8.0)]
print(" {:>6,} ".format(m) + " ".join(cells))
# Completeness measured by catalogue hours (modes of the six-module
# order of chapter 3): skin applied 3.0 h shown working, plus a
# read-only slot table worth half of the 3.0 h booking module.
CATALOGUE = [1.0, 3.0, 4.0, 3.0, 2.5, 2.0]
shown = math.fsum([3.0, 1.5])
print("catalogue hours {:.1f}; shown working {:.1f} -> completeness {:.3f}"
.format(math.fsum(CATALOGUE), shown, shown / math.fsum(CATALOGUE)))Single source and citation
Fan, Y. (2026). Demo-First B2B Closing, Forty-Eight-Hour Turnkey System Delivery and Scope-Creep Containment (Version 1.0.0), Chapter 2: How Complete Should a Preview Be? The Saturating Win-Rate Curve, the Optimal Completeness and Preview Compliance. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-368 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026368,
author = {Fan, Yafu},
title = {Demo-First B2B Closing, Forty-Eight-Hour Turnkey System Delivery and Scope-Creep Containment},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Break-Even Line of Demo-First Selling: Win-Rate Jumps, the Endowment Dispute and Name Personalisation
- Chapter 3 · Forty-Eight Hours Is a Distribution: Sums of Module Hours, the Probability of Being on Time and the Planning Fallacy
- Chapter 4 · Put the Buffer at the End of the Chain: Critical Chain, Fat-Tailed Modules and the Limits of Intake
- Chapter 5 · Free Revisions and Scope Creep: Poisson Request Rates, the Change-Pricing Lock and the Choice of Contract
- Chapter 6 · Upfront Payments, Milestones and the Hosting Retainer: Expected Cash and Retention Without Hostages
- Chapter 7 · Classical Sources East and West: Mozi on Gongshu Ban, the Kaogong ji, the Gospel of Luke and Vitruvius
- Chapter 8 · The Empirical Loop: Actuarial Tools and Execution Checklist for Demo and Delivery