What does Formalising Founder Wishes conclude, in numbers, about “Field Tools and Checker Specifications: The Wish Ledger, Red Lines and a Pre-Registered Test”?

Answer: Chapter 8 gives the distilled Wish Constraint Inversion and Counterexample Compiler, a table of checker specifications grouped by the four kits, the wish ledger and a pre-registered test whose first verdict needs 44 wishes. Marked boxes separate published evidence, runnable Python calculations (22 programs), classical sources and the author's hypotheses.

Scope of the numbers: Amounts are in illustrative units with no currency, parameters are illustrative, and all calculations are generated by the book's programs. The book is non-personalised business guidance, not personal financial or investment advice; the psychological literature is reported only as associations with their conditions, and the lower end of an interval is never a promise of income.

中文版

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: 44

(a) visitors per arm, conversion test
0.0200.030: 3,826 per arm, 7,652 in all
0.0200.025: 13,809 per arm, 27,618 in all
0.0300.036: 13,914 per arm, 27,828 in all
(b) compiled wishes, counterexample found before launch
p0 0.30 vs p1 0.5044 wishes
p0 0.30 vs p1 0.4578 wishes
p0 0.40 vs p1 0.50191 wishes
Show the full program
# Chapter 8. p82: pre-registered sample sizes for the prototype test
# (a) two-proportion test of a page change: baseline conversion against
# a better one, alpha 0.05 two-sided, power 0.80 (normal approximation).
# (b) the ledger test of the book's core claim: share of compiled wishes
# whose first counterexample is found before launch; one-sample test of
# p0 against p1. All rates are illustrative planning values.
import math
from statistics import NormalDist

Z = NormalDist()
za, zb = Z.inv_cdf(0.975), Z.inv_cdf(0.80)


def two_prop(p1, p2):
    pb = (p1 + p2) / 2
    a = za * math.sqrt(2 * pb * (1 - pb))
    b = zb * math.sqrt(p1 * (1 - p1) + p2 * (1 - p2))
    return math.ceil((a + b) ** 2 / (p2 - p1) ** 2)


def one_prop(p0, p1):
    a = za * math.sqrt(p0 * (1 - p0))
    b = zb * math.sqrt(p1 * (1 - p1))
    return math.ceil((a + b) ** 2 / (p1 - p0) ** 2)


print("(a) visitors per arm, conversion test")
for p1, p2 in ((0.020, 0.030), (0.020, 0.025), (0.030, 0.036)):
    n = two_prop(p1, p2)
    print("  {:.3f} -> {:.3f}: {:>8,} per arm, {:>8,} in all".format(
        p1, p2, n, 2 * n))
print("(b) compiled wishes, counterexample found before launch")
for p0, p1 in ((0.30, 0.50), (0.30, 0.45), (0.40, 0.50)):
    print("  p0 {:.2f} vs p1 {:.2f}: {:>5} wishes".format(
        p0, p1, one_prop(p0, p1)))

Single source and citation

Fan, Y. (2026). Formalising Fuzzy Founder Wishes: Constraint Inversion, Falsifiable Spec Synthesis and Executable Revenue System Compilation (Version 1.0.0), Chapter 8: Field Tools and Checker Specifications: The Wish Ledger, Red Lines and a Pre-Registered Test. 5D Library. DOI pending

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

BibTeX
@book{fan2026414,
  author    = {Fan, Yafu},
  title     = {Formalising Fuzzy Founder Wishes: Constraint Inversion, Falsifiable Spec Synthesis and Executable Revenue System Compilation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book