What does A Convergence Criterion for the Self-Evolving Engine conclude, in numbers, about “Local Audits and Pruning Gain: How Many Pairs Each New Rule Costs and How Many Conflicts Each Cut Removes”?

Answer: Chapter 5 shows that audit scope matters more than audit staff: checking only neighbours in the dependency graph costs about 7.2 checks per new rule against 2949.5 for the whole base, and greedy pruning by conflict count hits wrong rules at a rate of 0.818 against 0.330 for random pruning.

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: 2949.5, 7.2

mean pair checks per new rule (last 100 before n)
n full ancestors local
300249.5 124.7 7.8
1,000949.5 577.1 7.5
3,0002949.5 1950.3 7.2
quarterly cost of 24 new rules at n3,000, K = 6,000
full70,788 over K
ancestors46,808 over K
local173 within K
Show the full program
# Chapter 5. p51: what one new rule costs to check, by audit scope.
# Model (illustrative): rules arrive one by one; rule v cites k in
# {1, 2, 3} earlier rules, 0.8 of them from the 40 newest. Scopes:
#   full      check against every live rule          cost n
#   ancestors check against its whole premise closure
#   local     parents, grandparents and siblings (other rules that
#             cite one of its parents) at insertion time
# Mean cost over the 100 rules before each checkpoint; quarterly cost
# for 24 new rules against a budget K of 6,000 pair checks.
import math
import random


def grow(n, rng):
    par, kids, anc = [], [], []
    cost = {"full": [], "ancestors": [], "local": []}
    for v in range(n):
        k = min(v, rng.choice((1, 2, 3)))
        ps = set()
        while len(ps) < k:
            if rng.random() < 0.8:
                ps.add(rng.randrange(max(0, v - 40), v))
            else:
                ps.add(rng.randrange(0, v))
        a = 0
        near = set(ps)
        for u in ps:
            a |= anc[u] | (1 << u)
            near |= set(par[u]) | set(kids[u])
            kids[u].append(v)
        par.append(sorted(ps))
        kids.append([])
        anc.append(a)
        cost["full"].append(v)
        cost["ancestors"].append(bin(a).count("1"))
        cost["local"].append(len(near))
    return cost


if __name__ == "__main__":
    rng = random.Random(20261113)
    cost = grow(3000, rng)
    print("mean pair checks per new rule (last 100 before n)")
    print("      n      full  ancestors   local")
    for n in (300, 1000, 3000):
        row = [math.fsum(cost[s][n - 100:n]) / 100
               for s in ("full", "ancestors", "local")]
        print("  {:>5,}  {:>8.1f}  {:>9.1f}  {:>6.1f}".format(n, *row))
    print("quarterly cost of 24 new rules at n = 3,000, K = 6,000")
    for s in ("full", "ancestors", "local"):
        c = 24 * math.fsum(cost[s][2900:3000]) / 100
        print("  {:<9}  {:>9,.0f}  {}".format(
            s, c, "within K" if c <= 6000 else "over K"))

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 5: Local Audits and Pruning Gain: How Many Pairs Each New Rule Costs and How Many Conflicts Each Cut Removes. 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