What does Most Conflicts Are Redundancy conclude, in numbers, about “Closing the Loop: Plugging in the Pruner, Monthly Reduction and a Pre-Registered Test”?

Answer: Chapter 8 gives an eight-step monthly routine for the pruner, the distilled tool, the Rule Conflict Reducer, and a pre-registered test: 60 blind-labelled pairs, a rejection bound of 23 and a test size of 0.0462. Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.

Scope of the numbers: The rule libraries and values are illustrative; every calculation is generated by the book's programs; the book offers general business method, not legal, compliance or business-decision advice, and adding or deleting a rule must be released by its owner. Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.

中文版

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.0462, 23, 60

H0 share >= 0.5, one-sided exact binomial, alpha 0.05
true sharen(80%)reject if <=n(90%)reject if <=
0.1081112
0.20185237
0.3037135320
0.3569279338
plan n = 60: reject H0 if at most 23 are true contradictions
size under 0.5 = 0.0462; power at 0.20 = 0.9997, at 0.35 = 0.7529
Show the full program
# Chapter 8. p82: how many flagged conflicts must an audit label?
# Model: an auditor samples n flagged threshold conflicts at random
# from a real library and labels each, blind to the book's claim, as
# a true contradiction (no value satisfies both rules) or not. The
# common belief is that at least half of flagged conflicts are true
# contradictions (H0: share >= 0.5). The book claims the share is
# small. Exact one-sided binomial test at alpha 0.05: reject H0 when
# the count is at most c, with c the largest value whose probability
# under 0.5 is at most 0.05. The table gives the smallest n with exact
# power of at least 0.80 and 0.90 for true shares 0.10 to 0.35.

import math


def cdf(c, n, p):
    if c < 0:
        return 0.0
    return math.fsum(math.comb(n, k) * p ** k * (1 - p) ** (n - k)
                     for k in range(c + 1))


def crit(n, alpha=0.05):
    c = -1
    while cdf(c + 1, n, 0.5) <= alpha:
        c += 1
    return c


def smallest_n(p1, target):
    for n in range(5, 400):
        c = crit(n)
        if c >= 0 and cdf(c, n, p1) >= target:
            return n, c
    return None, None


print("H0 share >= 0.5, one-sided exact binomial, alpha 0.05")
print("true share   n(80%)  reject if <=   n(90%)  reject if <=")
for p1 in (0.10, 0.20, 0.30, 0.35):
    n8, c8 = smallest_n(p1, 0.80)
    n9, c9 = smallest_n(p1, 0.90)
    print("   %.2f      %5d  %12d   %6d  %12d" % (p1, n8, c8, n9, c9))
n = 60
c = crit(n)
print("plan n = %d: reject H0 if at most %d are true contradictions"
      % (n, c))
print("   size under 0.5 = %.4f; power at 0.20 = %.4f, at 0.35 = %.4f"
      % (cdf(c, n, 0.5), cdf(c, n, 0.2), cdf(c, n, 0.35)))

Single source and citation

Fan, Y. (2026). Cross-Volume Rule Resolution and Axiom Reduction: Detecting Threshold Conflicts among a Thousand Machine Rules and Finding a Minimal Primitive Set (Version 1.0.0), Chapter 8: Closing the Loop: Plugging in the Pruner, Monthly Reduction and a Pre-Registered Test. 5D Library. DOI pending

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

BibTeX
@book{fan2026258,
  author    = {Fan, Yafu},
  title     = {Cross-Volume Rule Resolution and Axiom Reduction: Detecting Threshold Conflicts among a Thousand Machine Rules and Finding a Minimal Primitive Set},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book