CyberRota Analysis
AI-GeneratedThe guard checker in Rocq Prover is vulnerable due to its failure to revalidate the recursive tree representation of an inductive type parameter after modifications, potentially leading to non-terminating definitions that can prove false statements. This flaw could allow attackers to exploit logical inconsistencies, undermining the integrity of proofs generated by the system. Organizations using Rocq Prover for formal verification should prioritize addressing this vulnerability to maintain the reliability of their proofs and avoid erroneous conclusions.
Public Exploit Signal
A public exploit, PoC, GitHub repository or Metasploit reference was detected for this CVE.
Note: these links are listed for security research and verification purposes only.
Original NVD Description
The guard checker in Rocq Prover does not recheck the recursive tree representation of an inductive type parameter after that parameter has been changed by transport. A fixpoint may apply a rewrite along an equality between types to its recursive argument, which the guard checker accepts because the inductive type is preserved, while the recursive tree recorded for the parameter is altered. A second fixpoint that calls the first inherits the altered recursive tree without verification, so a call that is not structurally decreasing is accepted as terminating. The resulting non-terminating definition proves that a natural number equals its own successor and therefore False, from which any proposition follows. The demonstration uses two axioms that follow from univalence and are consistent with the calculus of inductive constructions, so the contradiction comes from the guard check rather than from the assumptions. A fix is proposed but not merged.