What does Quantum-Inspired Search and Verified Conjectures conclude, in numbers, about “Closing the Empirical Loop: Standard Operating Templates and Checker Specification”?
Answer: Chapter 8 supplies a weekly ledger of original propositions, an optimisation log, the checker specification of the distilled Remote-Analogy Conjecture Refutation Pipeline and pre-registered tests. Marked boxes separate published evidence, runnable Python calculations (20 programs), classical sources and the author's hypotheses.
Scope of the numbers: Parameters are illustrative and all calculations are generated by the book's programs. Marked boxes separate published evidence, runnable Python calculations (20 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 only
| candidate S trap n95 searched bound verdict | |
| heat->RC circuit | 1.00 no 2,995 5,000 6.0e-04 OPEN |
| heat->cooking | 0.33 yes 2,995 5,000 6.0e-04 RETURN |
| annealing->restarts 0.80 no | 299 200 1.5e-02 MORE-SEARCH |
| bandit->review | 0.75 no 299 800 3.7e-03 RETURN |
| Euler 41 family | 1.00 no 29,956 40 7.2e-02 MORE-SEARCH |
| Polya-type sign | 1.00 no 299,573,225 300,000 1.0e-05 MORE-SEARCH |
| rule of three check: n | 300,000 bounds rho below 9.99e-06 |
| Polya: true first counterexample at 906,150,257; OPEN is not proof |
Show the full program
# Chapter 8. p81: the ledger checker behind the distilled tool.
# For each candidate proposition the ledger records: relations in the
# source domain, relations carried onto the target by the best mapping
# (Chapter 5), word overlap of the two domains, three falsifiability
# flags (a number, a refutation condition, a finite checkable range), a
# guessed counterexample density rho and the range already searched.
# Rules: structure S = carried / source; surface trap if overlap >= 0.3
# and S < 0.5; range needed so that one counterexample at density rho
# shows up with 95 % probability: n95 = ln 0.05 / ln(1 - rho); a clean
# search of n cases bounds the density below 1 - 0.05^(1/n), about 3 / n.
# Verdict: OPEN only if S >= 0.6, all three flags, and searched >= n95;
# MORE-SEARCH if only the range is short; RETURN otherwise. Entries are
# illustrative, not real proposals.
import math
LEDGER = [
("heat->RC circuit", 6, 6, 0.00, (1, 1, 1), 0.001, 5000),
("heat->cooking", 6, 2, 0.31, (1, 1, 1), 0.001, 5000),
("annealing->restarts", 5, 4, 0.10, (1, 1, 1), 0.01, 200),
("bandit->review", 4, 3, 0.05, (1, 0, 1), 0.01, 800),
("Euler 41 family", 3, 3, 0.00, (1, 1, 1), 0.0001, 40),
("Polya-type sign", 3, 3, 0.00, (1, 1, 1), 1e-8, 300000),
]
def n95(rho):
return math.ceil(math.log(0.05) / math.log(1.0 - rho))
def density_bound(n):
return 1.0 - 0.05 ** (1.0 / n)
def verdict(src, carried, overlap, flags, rho, searched):
s = carried / src
trap = overlap >= 0.3 and s < 0.5
need = n95(rho)
if s >= 0.6 and all(flags) and searched >= need:
v = "OPEN"
elif s >= 0.6 and all(flags):
v = "MORE-SEARCH"
else:
v = "RETURN"
return s, trap, need, v
if __name__ == "__main__":
print(" candidate S trap n95 searched"
" bound verdict")
for name, src, car, ov, fl, rho, n in LEDGER:
s, trap, need, v = verdict(src, car, ov, fl, rho, n)
print(" {:<19} {:.2f} {:<4} {:>11,} {:>9,} {:.1e} {}".format(
name, s, "yes" if trap else "no", need, n,
density_bound(n), v))
print(" rule of three check: n = 300,000 bounds rho below {:.2e}"
.format(density_bound(300000)))
print(" Polya: true first counterexample at 906,150,257;"
" OPEN is not proof")Single source and citation
Fan, Y. (2026). Quantum-Inspired Combinatorial Search, Abductive Intuition and Computationally Verified Breakthrough Monograph Engineering (Version 1.0.0), Chapter 8: Closing the Empirical Loop: Standard Operating Templates and Checker Specification. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-364 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026364,
author = {Fan, Yafu},
title = {Quantum-Inspired Combinatorial Search, Abductive Intuition and Computationally Verified Breakthrough Monograph Engineering},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Square-Root Wall: a Classical Simulation of Amplitude Amplification and the Lower Bound for Unstructured Search
- Chapter 2 · Annealing, Restarts and the Metropolis Rule: Classical Recipes for Escaping Local Optima
- Chapter 3 · The Burden of Proof for a Speedup: Time to Solution, Scaling Laws and Dequantisation
- Chapter 4 · Amplifying Samples by Value: Importance Sampling and Upper Confidence Bounds
- Chapter 5 · Shared Structure: Spectral Fingerprints, Exhaustive Mappings and the Typicality of Combinations
- Chapter 6 · A Pipeline for Ramanujan-Style Conjectures: Abundant Generation, Exhaustive Refutation and Exact Bounds
- Chapter 7 · Following the Natural Joints and Reasoning to Hypotheses: Cook Ding, Shen Kuo, Peirce and Hardy