# Verification report

Status: accepted complete computer-assisted proof, six-page English paper.
Written proof: all n>=8, including zero terms, even inputs, prime powers and odd semiprimes.
Originating-researcher audit: complete; known mathematical gaps: none.
Independent peer review: not performed. Proof-assistant formalization: not performed.
Bounded literature review: complete; absolute priority is not certified.

C++ exact endgames: 1683064 odd primes p<27000000; base-3 square exceptions 11 and 1006003, both excluded by 5; 4571 base-3-liar pairs with p<q<150000, all excluded by a tested odd base, maximum 31. Python independently reproduces both entire finite domains, using different semiprime coverage organization and arbitrary-precision modular arithmetic. Its local audit records 721343 exact conditions, 19992 literal integer sums and 149984 polynomial-parameter cases. These condition counts do not include every modular multiplication and are not a count of solved problems.

PDF: built-in compiler success; local portable compiler success; six pages inspected directly; no overfull/underfull boxes or undefined references. Only the author name is prominent; affiliation and contacts are a footnote. AI assistance is disclosed in prose.

Checker SHA-256: a19ba72c51d4e7193028c13c5f20f738b2c4f9874c7b4c07c31a553f5144e7a6 (C++), 1006bc9e5c490b50b2e67d8ce2d43fd393b7f63a2faadc48c7a4014048e66416 (Python).
Witness CSV SHA-256: fec375c9c01d25544a68fa93c2163529d93a2f4d70b9b18a324ed1ad115404c6.
The former peer scan below 3e10 is preserved and not required by this proof.