What does A Convergence Criterion for the Self-Evolving Engine conclude, in numbers, about “The Square Law of Conflict Pairs: n Choose 2, a Fixed Audit Budget and the Backlog”?
Answer: With \(q\) at 0.001, one clash per thousand pairs, the base sounds clean. Yet three hundred rules carry 44.85 expected conflicts and twenty-four hundred rules carry 2878.8. At a hundred rules a base with \(q\) of 0.0001 still has a 0.6096 chance of being free of conflict; once \(q\) rises to 0.001 that chance falls to 0.0071.
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: 0.0001, 0.001, 0.0071, 0.6096, 2878.8, 44.85
| A. expected conflicts q*C(n,2) and P(no conflict) | |
| q n | 100 n=300 n=1000 n=2400 P0(n=100) |
| 0.0001 | 0.50 4.49 50.0 287.9 0.6096 |
| 0.001 | 4.95 44.85 499.5 2878.8 0.0071 |
| 0.005 | 24.75 224.25 2497.5 14394.0 0.0000 |
| B. first n with P(no conflict) < 0.5 | |
| q | 0.0001 n_half = 119 (sqrt rule 117.7) |
| q | 0.001 n_half = 38 (sqrt rule 37.2) |
| q | 0.005 n_half = 18 (sqrt rule 16.7) |
| C. expected conflicts per rule = q (n - 1) / 2 | |
| q | 0.001, n = 300: 0.149 per rule |
| q | 0.001, n = 1,200: 0.600 per rule |
| q | 0.001, n = 2,400: 1.200 per rule |
Show the full program
# Chapter 1. p13: realised conflicts when each pair clashes with prob q.
# Model: pairs clash independently with probability q (illustrative),
# so realised conflicts ~ Binomial(C(n,2), q) with mean
# q C(n,2) and P(no conflict) = (1 - q)^C(n,2). The size n_half at
# which P(no conflict) first drops below one half is the analogue of
# the birthday bound: about sqrt(2 ln 2 / q).
import math
def p_clean(n, q):
return math.exp(math.comb(n, 2) * math.log1p(-q))
def n_half(q):
n = 2
while p_clean(n, q) >= 0.5:
n += 1
return n
if __name__ == "__main__":
print("A. expected conflicts q*C(n,2) and P(no conflict)")
print(" q n=100 n=300 n=1000 n=2400 P0(n=100)")
for q in (0.0001, 0.001, 0.005):
row = [q * math.comb(n, 2) for n in (100, 300, 1000, 2400)]
print(" {:<7}{:>9.2f}{:>10.2f}{:>10.1f}{:>10.1f}{:>11.4f}".format(
q, row[0], row[1], row[2], row[3], p_clean(100, q)))
print("B. first n with P(no conflict) < 0.5")
for q in (0.0001, 0.001, 0.005):
est = math.sqrt(2 * math.log(2) / q)
print(" q = {:<7} n_half = {:>4} (sqrt rule {:.1f})".format(
q, n_half(q), est))
print("C. expected conflicts per rule = q (n - 1) / 2")
q = 0.001
for n in (300, 1200, 2400):
print(" q = {}, n = {:>5,}: {:.3f} per rule".format(
q, n, q * (n - 1) / 2))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 1: The Square Law of Conflict Pairs: n Choose 2, a Fixed Audit Budget and the Backlog. 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 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
- Chapter 8 · The Quarterly Convergence Check-up: Procedure, the Engine Convergence Criterion Calculator and a Pre-registered Plan of Refutation