Paper 2025/1720
BATTLE – Bonded Adversarial TournamenT with Logarithmic Escalation
Abstract
In our work, we introduce BATTLE, Bonded Adversarial TournamenT with Logarithmic Escalation, a tournament-style protocol that solves multiparty disputes with simultaneous assertions such that (i) bounds honest asserter capital requirements to a constant minimum initial capital and (ii) resolves any number $C$ of concurrent challenges in $\mathcal{O}(\log C)$ dispute rounds, by reinvesting dispute rewards to fund subsequent rounds (progressive buy-ins) (iii) can be realized on a stateful (Quasi)Turing-complete smart-contract enabled blockchain. BATTLE solves a set of conflicting assertions by creating a tournament with two phases: (1) a bracket among competing asserters with one dispute per party per round, and (2) a challenger phase against the winning assertion where the asserter engages in increasing number of simultaneous disputes each round.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- Dispute ResolutionBlockchainFraud-proofssmart-contracts
- Contact author(s)
-
sergio @ fairgate io
futo @ fairgate io - History
- 2025-09-22: approved
- 2025-09-21: received
- See all versions
- Short URL
- https://ia.cr/2025/1720
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2025/1720,
author = {Sergio Demian Lerner and Ariel Futoransky},
title = {{BATTLE} – Bonded Adversarial {TournamenT} with Logarithmic Escalation},
howpublished = {Cryptology {ePrint} Archive, Paper 2025/1720},
year = {2025},
url = {https://eprint.iacr.org/2025/1720}
}
