Anything deterministic that doesn't need I/O. Same inputs always produce same outputs. If it compiles to WebAssembly, it can be verified.
Prove that generative art follows the claimed algorithm. No trust in rendering process. Collectors verify execution cryptographically.
Prove that your bot executes the strategy you published. Users verify bot behavior without trusting the operator. No frontrunning, no hidden parameters.
Prove that winner selection used blockchain entropy and claimed RNG algorithm. Participants verify fairness cryptographically. No trust in operator required.
Prove that a model produced specific outputs on specific inputs. Trustless AI services where users verify predictions. No trust in compute provider.
Determinism makes fraud binary and provable. When two parties disagree about deterministic computation, exactly one is lying. Bisection narrows disputes to 32 bytes.
WebAssembly with no threads, syscalls, or undefined behavior. Same inputs always produce same outputs. Modules validated before registration to reject floating-point ops and non-deterministic instructions.
Binary search over execution trace. Each round halves dispute space. After ~20 rounds, disagreement narrows to 32 bytes. Final segment executes on-chain via Arbitrum Stylus. 97% gas savings vs naive re-execution.
Executors stake 2× job payment. Fraud loses entire stake. Honest execution returns collateral plus payment. Fixed 2× ratio for all executors ensures fair competition.
Verifiers earn 20% of slashed collateral for catching fraud. Costs $0.38 in gas to prove. Nets $19.62 profit on $50 job. Deterministic execution ensures 100% detection rate, not probabilistic.
3 verifiers randomly selected after executor commits result. 11 entropy sources prevent manipulation. Selection weighted by staked CERTUS. Collusion requires controlling on-chain randomness.
Inputs ≤100KB stored on-chain permanently. Larger inputs use Arweave with 10% bond. Data unavailability during challenge window triggers automatic slashing. Disputes always resolvable.
Fraud detection is profitable at launch. Honest execution is economically rational. Deterministic detection makes fraud suicide.
| METRIC | CERTUS | OPTIMISTIC ROLLUPS | ORACLES |
|---|---|---|---|
| Trust Assumptions | 0 | 1-honest | M-of-N |
| Fraud Proof Cost | $0.38 | $12.50 | N/A |
| Challenge Period | 1 hour | 7 days | N/A |
| Capital Efficiency | High | Low | N/A |
| Detection Rate | 100% | 100% | Probabilistic |
| Permissionless | Yes | Complex | No |
| General Compute | Yes | No | Limited |
Blockchains verify money. Certus verifies everything else. Trustless, general-purpose, economically viable verifiable compute without trust assumptions.