PROVING MODEL
Optimistic speed,
ZK-secured finality.
Challenges
Matrix operates on a dual-track state validation system.
The first is an optimistic track, where whitelisted proposers submit state roots backed by a GAS bond and remain challengeable within a configurable dispute window.
The second is a validity-proof track, where anyone can submit a ZK proof that directly verifies the block sequence and resolves disputes instantly.
ZK validity proofs bypass the optimistic flow entirely and can invalidate multiple incorrect optimistic proposals that target the same state root.
When an optimistic proposal is challenged, the proposer must defend their submission by providing a ZK proof within the proving window, or the GAS bond is slashed.
Validity Proofs
Matrix uses a pluggable zkVM / Prover system to generate zero-knowledge validity proofs that verify L2 state transitions for each interval.
Anyone can submit a validity proof through the proveBlock() function of the Rollup contract to bypass the optimistic track and directly finalize the corresponding anchor block.
Submitting a validity proof during a challenge resolves the dispute in a single transaction, enabling faster settlement and ensuring that state correctness is guaranteed by mathematics rather than trust assumptions.
Challenges
Matrix operates on a dual-track state validation system.
The first is an optimistic track, where whitelisted proposers submit state roots backed by a GAS bond and remain challengeable within a configurable dispute window.
The second is a validity-proof track, where anyone can submit a ZK proof that directly verifies the block sequence and resolves disputes instantly.
ZK validity proofs bypass the optimistic flow entirely and can invalidate multiple incorrect optimistic proposals that target the same state root.
When an optimistic proposal is challenged, the proposer must defend their submission by providing a ZK proof within the proving window, or the GAS bond is slashed.
Validity Proofs
Matrix uses a pluggable zkVM / Prover system to generate zero-knowledge validity proofs that verify L2 state transitions for each interval.
Anyone can submit a validity proof through the proveBlock() function of the Rollup contract to bypass the optimistic track and directly finalize the corresponding anchor block.
Submitting a validity proof during a challenge resolves the dispute in a single transaction, enabling faster settlement and ensuring that state correctness is guaranteed by mathematics rather than trust assumptions.
Challenges
Matrix operates on a dual-track state validation system. The first is an optimistic track, where whitelisted proposers submit state roots backed by a GAS bond and remain challengeable within a configurable dispute window.
The second is a validity-proof track, where anyone can submit a ZK proof that directly verifies the block sequence and resolves disputes instantly.
ZK validity proofs bypass the optimistic flow entirely and can invalidate multiple incorrect optimistic proposals that target the same state root.
When an optimistic proposal is challenged, the proposer must defend their submission by providing a ZK proof within the proving window, or the GAS bond is slashed.
Validity Proofs
Matrix uses a pluggable zkVM / Prover system to generate zero-knowledge validity proofs that verify L2 state transitions for each interval.
Anyone can submit a validity proof through the proveBlock() function of the Rollup contract to bypass the optimistic track and directly finalize the corresponding anchor block.
Submitting a validity proof during a challenge resolves the dispute in a single transaction, enabling faster settlement and ensuring that state correctness is guaranteed by mathematics rather than trust assumptions.