Function compute_capability_proof 

pub fn compute_capability_proof(
    before: &IntentGraph,
    after: &IntentGraph,
) -> CapabilityProofReport

Compute a capability monotonicity proof by diffing two intent graphs.

The before graph represents the original extension’s capabilities. The after graph represents the repaired extension’s capabilities.

A repair is monotonic (safe) if and only if after introduces no signals that were absent from before. Removals are allowed.