TITLE: Comparator Run Verification Record
PROBLEM: A Lean proof can compile perfectly and still prove the wrong statement — if the code redefines a symbol, the "proof" means something else — yet the check that catches this, the comparator run, is often left undocumented while headlines declare the problem solved.
SOLUTION: A comparator run verification record: the statement as formalized, the standard statement it must match, the independent kernels used in paranoid mode, and the result — matched, mismatched, or pending — published before any public claim of confirmation.
EVIDENCE BASIS: DOCUMENTED — Researchers were still awaiting a successful comparator run at reporting time, which checks (a) the code does not redefine the meaning of any symbol in the statement and (b) the code compiles with several independent kernels in paranoid mode. UNVERIFIED — Whether Alpöge's formalization faithfully states the standard Riemann Hypothesis; the comparator run was pending. The combined RH system is inventor CONCEPT ONLY.
| Idea priority | Low |
| Needed By | Not sure -- Just thought it was cool |
By clicking the "Post Comment" or "Submit Idea" button, you are agreeing to the IBM Ideas Portal Terms of Use.
Do not place IBM confidential, company confidential, or personal information into any field.