.:: Owning the Truth: Undecidability, unsound kernels, and the forging of proof ::.
Researchers present a constructive reduction of Rice's theorem to highlight the theoretical limits of program verification and the presence of unsound proof kernels. The authors demonstrate twelve soundness proofs and CVEs across six major proof assistants, a pure-Lean exploit chain achieving arbitrary code execution, and forged proofs of Millennium Prize Problems, emphasizing that verification systems are vulnerable to logical soundness flaws. Open article →