Unrefereed AI-assisted preprint, No.43, version 1.0. Historical novelty remains inconclusive (reviewer assessment: low); this is not human peer review. For standard fixed vertex leaks on the prism G_n = C_n Cartesian-product K_2 = GP(n,1), the paper classifies every inclusion-minimal two-leaky fort for n >= 5: the 2n diagonal pairs and, for even n, two alternating full-column sets. This characterizes every successful initial blue set. The number of successful sets of size k is (2n/k) binomial(k,2n-k), for n <= k <= 2n; their total is L_(2n). The minimum is n, attained only by the two full rows. Small n=3,4 have separate polynomials and totals 10,25. The work resumes the unnumbered G1 candidate recorded on 12 October 2026. It is not a new mathematical discovery made on the publication date. Fort duality, the known upper bound, independent-set enumeration, Lucas numbers and transfer matrices are not claimed as new. The proposed contribution is limited to this graph family's explicit complete fort classification and enumeration. References remain PARTIAL: comparison with Herrman's final published text and other general results is unfinished. This p=1 note does not solve Herrman's numbered Problem 5.2, which concerns p >= 2. The received AI audit reports MODEL / PROOF / COMPUTATION PASS. Saved author-side evidence covers 5,592,384 subsets for n=3 through 11 and 2,128,512 pairs (B,L) for n=3 through 7, plus four negative controls, on Linux / Python 3.12.14 / CPU. A separately written exhaustive C check through n=10 is reviewer-reported; its source, raw logs, compiler and platform were not supplied. Windows-native reproduction has not been performed. Finite checks support only their finite ranges; the all-n result rests on the proof. The ZIP includes the full proof, source, three verification scripts, frozen evidence, review records, hashes and the byte-identical audited v0.2 archive. Publication changes only metadata and documentation; the mathematical content, verifiers and original evidence are unchanged. Repository: https://github.com/yonezaemon1-hub/no43-prism-two-leaky-forcingCopyright (c) 2026 Ryutaro Yonezu. All rights reserved.Research inquiries: yonezaemon1+research@gmail.com
No takes yet. Share an insight, caveat, or question.
Ryutaro Yonezu (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: