4 papers
Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience
Jovan Komatovic, Joachim Neu, Tim Roughgarden
Multi-valued validated Byzantine agreement (MVBA), a fundamental primitive of distributed computing, allows processes to agree on a valid -bit value, despite faulty p…
Beyond Winner-Take-All Procurement Auctions
Pranav Garimidi, Michael Neuder, Tim Roughgarden
Blockchain protocols often seek to procure computationally challenging work from a decentralized set of participants. While there are simple procurement auctions that result in the…
Collusion-Resilience in Transaction Fee Mechanism Design
Hao Chung, Tim Roughgarden, Elaine Shi
Users bid in a transaction fee mechanism (TFM) to get their transactions included and confirmed by a blockchain protocol. Roughgarden (EC'21) initiated the formal treatment of TFMs…
Transaction Fee Mechanism Design for Leaderless Blockchain Protocols
Pranav Garimidi, Lioba Heimbach, Tim Roughgarden
We initiate the study of transaction fee mechanism design for blockchain protocols in which multiple block producers contribute to the production of each block. Our contributions i…