What does A Convergence Criterion for the Self-Evolving Engine conclude, in numbers, about “The Quarterly Convergence Check-up: Procedure, the Engine Convergence Criterion Calculator and a Pre-registered Plan of Refutation”?
Answer: Chapter 8 gives the quarterly convergence check-up, the distilled Engine Convergence Criterion Calculator and a pre-registered plan of refutation, in which testing the effect of pruning needs 7,785 audited pairs per arm. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.
Scope of the numbers: Its parameters are illustrative and contain no production information; all calculations are generated by its programs; it is general business analysis, not business advice. Chapter 4 sorts with Kahn's algorithm and finds and repairs cycles with strongly connected components; in a synthetic citation graph of three hundred volumes, 18,828 pairs are comparable, a share of 0.420.
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: 7785
| Test 1: audited pairs per arm (q0 | 0.010) |
| q1 | 0.008: 35,001 pairs per arm |
| q1 | 0.006: 7,785 pairs per arm |
| q1 | 0.005: 4,673 pairs per arm |
| Test 2: one-window power of t(b2) > 3 on case A | |
| w end b2 E[t] power | |
| 8 | 14 0.792 0.97 0.021 |
| 12 | 14 0.792 3.16 0.565 |
| 12 | 24 0.792 1.62 0.085 |
| 16 | 24 0.792 3.68 0.750 |
| 16 | 40 0.792 1.98 0.153 |
| 24 | 40 0.792 6.11 0.999 |
Show the full program
# Chapter 8. p82: sample sizes for the pre-registered tests.
# Test 1 (pruning works): clash rate per audited pair among rules that
# passed screening (q1) against unscreened rules (q0); two-sided
# alpha 0.05, power 0.80, normal approximation for two proportions.
# Test 2 (quadratic law): power of the strict curvature alarm, t(b2)
# > 3, on a w-quarter window of case A means of p33 ending at quarter
# e, with Poisson noise sd = sqrt(mean). Expected t = b2 / se(b2);
# power = Phi(E[t] - 3) for one window.
# Rates and windows are illustrative.
import math
from statistics import NormalDist
Z = NormalDist()
def n_two_props(p0, p1, alpha=0.05, power=0.80):
za = Z.inv_cdf(1 - alpha / 2)
zb = Z.inv_cdf(power)
pb = (p0 + p1) / 2
num = (za * math.sqrt(2 * pb * (1 - pb))
+ zb * math.sqrt(p0 * (1 - p0) + p1 * (1 - p1))) ** 2
return math.ceil(num / (p1 - p0) ** 2)
def case_a(quarters, a=24, eps=0.25, g=0.5, k=4):
good, noise, mu = 0.0, 0.0, []
for _ in range(quarters):
good = good + (1 - eps) * a
noise = noise + eps * a - min(k, g * noise)
mu.append(0.02 * (noise * good + noise * (noise - 1) / 2)
+ 0.0002 * good * (good - 1) / 2)
return mu
def expected_t(ys):
w = len(ys)
s = [i - (w - 1) / 2 for i in range(w)]
m2 = math.fsum(u * u for u in s) / w
d = [u * u - m2 for u in s]
sdd = math.fsum(x * x for x in d)
b2 = math.fsum(x * y for x, y in zip(d, ys)) / sdd
var = math.fsum(ys) / w
return b2, b2 / math.sqrt(var / sdd)
if __name__ == "__main__":
print("Test 1: audited pairs per arm (q0 = 0.010)")
for q1 in (0.008, 0.006, 0.005):
print(" q1 = {:.3f}: {:>7,} pairs per arm".format(
q1, n_two_props(0.010, q1)))
print("Test 2: one-window power of t(b2) > 3 on case A")
print(" w end b2 E[t] power")
mu = case_a(40)
for w, e in ((8, 14), (12, 14), (12, 24), (16, 24), (16, 40),
(24, 40)):
b2, t = expected_t(mu[e - w:e])
print(" {:>2} {:>4} {:.3f} {:>5.2f} {:.3f}".format(
w, e, b2, t, Z.cdf(t - 3.0)))Single source and citation
Fan, Y. (2026). Topological Ordering of the Theorem-Dependency Graph of Three Hundred Volumes and a Convergence Criterion for the Self-Evolving Engine: Halting Conditions between Proposal Noise and Pruning Gain (Version 1.0.0), Chapter 8: The Quarterly Convergence Check-up: Procedure, the Engine Convergence Criterion Calculator and a Pre-registered Plan of Refutation. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-332 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026332,
author = {Fan, Yafu},
title = {Topological Ordering of the Theorem-Dependency Graph of Three Hundred Volumes and a Convergence Criterion for the Self-Evolving Engine: Halting Conditions between Proposal Noise and Pruning Gain},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Square Law of Conflict Pairs: n Choose 2, a Fixed Audit Budget and the Backlog
- Chapter 2 · Requisite Variety: When the Information Budget of Pruning Covers the Noise of Proposals
- Chapter 3 · Difference Equations and Stability: Pruning Gain, Audit Delay and Oscillation
- Chapter 4 · The Theorem-Dependency Graph: Kahn's Topological Sort, Cycle Detection and a Synthetic Graph of Three Hundred Volumes
- Chapter 5 · Local Audits and Pruning Gain: How Many Pairs Each New Rule Costs and How Many Conflicts Each Cut Removes
- Chapter 6 · Halting Conditions: the Halting Size and a Curvature Alarm on Conflicts
- Chapter 7 · Eastern and Western Sources: "Generation upon Generation" in the Great Commentary and Wiener's Cybernetics