Cartesi uses core tournament contracts to implement an asynchronous PRT-style dispute resolution mechanism. This system resolves disputes among N parties in O(log N) depth using chess-clock timing and asynchronous pairing (claims are matched as they arrive without a prebuilt bracket).
Concrete implementations include:
SingleLevelTournament: For single-level disputes.TopTournament: The root of multi-level instances.MiddleTournament: Intermediate levels.BottomTournament: The leaf level where actual state transitions are performed.