Looking for Attention: Randomized Attention Test Design for Validator Monitoring in Optimistic Rollups

TL;DR

This paper proposes the Randomized Attention Test (RAT), a protocol to ensure validator diligence in Optimistic Rollups, achieving security with low costs and minimal overhead through game-theoretic analysis.

Contribution

Introduces RAT, a novel L1-based protocol for probabilistically testing validator attentiveness in ORUs, enhancing security and liveness guarantees.

Findings

Achieves an ideal security equilibrium with low economic penalties.

Maintains low test frequency and operational costs.

Fortifies ORU security by incentivizing validator diligence.

Abstract

Optimistic Rollups (ORUs) significantly enhance blockchain scalability but inherently suffer from the verifier's dilemma, particularly concerning validator attentiveness. Current systems lack mechanisms to proactively ensure validators are diligently monitoring L2 state transitions, creating a vulnerability where fraudulent states could be finalized. This paper introduces the Randomized Attention Test (RAT), a novel L1-based protocol designed to probabilistically challenge validators in ORUs, thereby verifying their liveness and computational readiness. Our game-theoretic analysis demonstrates that an Ideal Security Equilibrium, where all validators are attentive and proposers are honest, can be achieved with RAT. Notably, this equilibrium is attainable and stable with relatively low economic penalties (under \$1000) for non-responsive validators, a low attention test frequency (under 1\% per epoch), and a minimal operation overhead (monthly under \$30) with 10 validators. RAT thus provides a pivotal, practical mechanism to enforce validator diligence, fortifying the overall security and integrity of ORU systems with minimizing additional costs.