What does A Convergence Criterion for the Self-Evolving Engine conclude, in numbers, about “Eastern and Western Sources: "Generation upon Generation" in the Great Commentary and Wiener's Cybernetics”?
Answer: Chapter 7 examines "generation upon generation is called change" from the Great Commentary on the Book of Changes and Wiener's Cybernetics of 1948.
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 only
| delta | n@40 | renew@40 | n@400 | renew@400 | pairs@400 |
| 0.00 | 960 | 0.100 | 9,600 | 0.010 | 46,075,200 |
| 0.01 | 794 | 0.119 | 2,357 | 0.040 | 2,776,354 |
| 0.02 | 665 | 0.140 | 1,200 | 0.078 | 718,955 |
| 0.05 | 418 | 0.213 | 480 | 0.185 | 114,960 |
| limit renewal at delta 0.05 = 0.185 |
Show the full program
# Chapter 7. p71: "great possession" versus "daily renewal".
# Model: 24 rules enter per quarter; each quarter a share delta of the
# live rules retires (age-blind). Renewal share = live rules younger
# than 4 quarters. With delta = 0 the base only accumulates and the
# renewal share decays like 4 / t; with delta > 0 the base settles at
# a / delta and renewal tends to 1 - (1 - delta)^4. Pairs = C(n, 2).
# Retirement shares are illustrative.
import math
def run(delta, quarters, a=24):
cohorts = []
for _ in range(quarters):
cohorts = [c * (1 - delta) for c in cohorts]
cohorts.append(float(a))
n = math.fsum(cohorts)
y = math.fsum(cohorts[-4:])
return n, y / n
if __name__ == "__main__":
print(" delta n@40 renew@40 n@400 renew@400 pairs@400")
for d in (0.0, 0.01, 0.02, 0.05):
n40, r40 = run(d, 40)
n4, r4 = run(d, 400)
print(" {:.2f} {:>5.0f} {:>8.3f} {:>8,.0f} {:>9.3f} {:>10,.0f}"
.format(d, n40, r40, n4, r4, n4 * (n4 - 1) / 2))
print("limit renewal at delta 0.05 = {:.3f}".format(1 - 0.95 ** 4))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 7: Eastern and Western Sources: "Generation upon Generation" in the Great Commentary and Wiener's Cybernetics. 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 8 · The Quarterly Convergence Check-up: Procedure, the Engine Convergence Criterion Calculator and a Pre-registered Plan of Refutation