5 papers
Fully Fluctuating Sleepy Consensus from Minimal Assumptions
Javier Nieto, Yuval Efron, Joachim Neu +1
Bitcoin's proof-of-work (PoW)-based protocol is remarkable for how little it asks of its participants. Not only can miners take breaks from work whenever they please, but it is alm…
Optimal Good-Case Latency for Sleepy Consensus
Yuval Efron, Joachim Neu, Ling Ren +1
In the context of Byzantine consensus problems such as Byzantine broadcast (BB) and Byzantine agreement (BA), the good-case setting aims to study the minimal possible latency of a…
On the Limits of Consensus under Dynamic Availability and Reconfiguration
Javier Nieto, Joachim Neu, Ling Ren
Proof-of-stake blockchains require consensus protocols that support Dynamic Availability and Reconfiguration (which we call the DAR model). Here, Dynamic Availability means that th…
Fully-Fluctuating Participation in Sleepy Consensus
Yuval Efron, Joachim Neu, Toniann Pitassi
Proof-of-work allows Bitcoin to boast security amidst arbitrary fluctuations in participation of miners throughout time, so long as, at any point in time, a majority of hash power…
Mechanism Design for Automated Market Makers
T-H. Hubert Chan, Ke Wu, Elaine Shi
Blockchains have popularized automated market makers (AMMs). An AMM exchange is an application running on a blockchain which maintains a pool of crypto-assets and automatically tra…