verifiable game engine - live on solana devnet
Real-money matches where the chain is the referee.
Every PvP wagering platform on Solana today trusts a server to report who won. tickproof removes the reporter entirely: game logic compiles to SBF, runs off-chain at full speed, and any disputed tick is replayed by the L1 itself - the chain already executes SBF natively, so the final step of a dispute is just a program invocation. No oracle, no zkVM, no interpreter-in-a-contract.
How a match settles without trust
- 01
Escrow
Both players lock their stake in the wager program. The match account pins the game program, the genesis state commitment and the final tick.
- 02
Play off-chain
The match runs at full speed through the real agave runtime in an embedded VM. State roots and an input chain are committed at checkpoints.
- 03
Prove or co-sign
If both players agree, two signatures settle instantly. If not, either player asserts the final checkpoint with a bond and it survives a challenge window.
- 04
The chain decides
A lying assertion gets bisected to the exact divergent tick, which the cluster replays natively. The game program itself names the winner over the proven state.
Measured, not promised
Every figure below comes from the real agave runtime or from confirmed devnet transactions - the repository reproduces all of them.
~2,000 CU
one arena tick under the real agave runtime
~19k CU
complete one-step fraud proof, ~1.4% of a tx budget
~13k CU
trustless settle instruction (root check + verdict CPI + payout)
~17k ticks/s
engine throughput through the full runtime pipeline
6 tx / 31 s
honest match settled on devnet, 65k lamports in fees
20 tx / 47 s
full adversarial settlement: cheater bisected, convicted, paid out