A governance proof is a self-contained cryptographic artifact that demonstrates a governance decision was made correctly, deterministically, and in accordance with policy — without requiring access to the runtime or infrastructure that produced it. Governance proofs are the mechanism that makes compliance evidence portable. An auditor, counterparty, or regulator can verify a governance proof using only the public key and the proof bundle itself.Documentation Index
Fetch the complete documentation index at: https://docs.manthan.systems/llms.txt
Use this file to discover all available pages before exploring further.
What makes a proof valid
A valid governance proof demonstrates:- The input signals were admitted through the schema-validated admissibility layer
- Policy evaluation was applied deterministically to those signals
- The resulting decision was cryptographically signed by the governance runtime
- The proof bundle can be independently replayed and the replay hash verified
Governance Proof Generation
The proof generation sequence
Append-Only Lineage — Every governance decision is written to an append-only log. The lineage cannot be modified after the fact; only new entries can be appended. Replay Reconstruction — The lineage is replayed to reconstruct the exact sequence of decisions. Replay uses the same deterministic runtime that produced the original decisions. Replay Hash — The reconstructed replay produces a deterministic hash. If the hash differs from the original, the lineage has been tampered with. Manifest Continuity — The replay hash is validated against the signed manifest, establishing that the lineage is continuous and unmodified. Governance Signature — The runtime signs the proof payload using Ed25519. The signature is over the canonical, deterministic representation of the decision. Portable Proof Bundle — The complete bundle (attestation, manifest, replay hash, signature) is exported as a self-contained artifact. No infrastructure access is needed to verify it.Long-term validity
Governance proofs are designed to remain verifiable indefinitely:- The signature algorithm (Ed25519) is standardized and stable
- The canonical serialization format does not change across runtime versions
- The public key required for verification is the only external dependency
See also
- Portable Verification - how proofs are verified independently
- Immutable Lineage - the append-only record that proofs are built on
- Trust Portability - what portability guarantees and what breaks it
- Attestations - the signed record at the center of every proof