3 citations · 6 across the 11 of their papers we have counts for
13 papers
Revisiting Fast Tendermint: An Agreement Violation and Two Repairs
Alejandro Ranchal-Pedrosa
Fast Tendermint reduces Tendermint's good-case latency to two communication steps for n>=5f+1. We show that its published round-change rule violates Agreement: one Byzantine proces…
A BUD You Can Count On: Efficient, Verifiable Membership Proofs
Alejandro Ranchal-Pedrosa, Cody Littley, Ben Marsh
A block typically changes only a small fraction of blockchain state, yet producing a state root makes validators update an authenticated tree spanning it all. We show how to suppor…
Hermes: Low Tail-Latency Via Prefix Consensus
Alejandro Ranchal-Pedrosa, Dakai Kang, Neil Giridharan +3
Leader-based BFT protocols finalize through their leaders: a view whose leader is crashed or slow finalizes nothing, and the timeout that ends it admits no good setting. A conserva…
Slack and Budget Breaking in Threshold Team Production
Benjamin Marsh, Alejandro Ranchal-Pedrosa
A threshold system completes a public task only after verifiable shares are publicly committed. If the honest schedule creates \( \Nstar=κ+Δ\) share opportunities by deadline $…
SNARE: A TRAP for Rational Players to Solve Byzantine Consensus in the 5f+1 Model
Alejandro Ranchal-Pedrosa, Benjamin Marsh
The TRAP protocol solves rational agreement by combining accountable consensus with a one-shot BFTCR finalization phase. We present SNARE (Scalable Nash Agreement via Reward and Ex…
A mechanism design overview of Sedna
Benjamin Marsh, Alejandro Ranchal-Pedrosa
Sedna is a coded multi-proposer consensus protocol in which a sender shards a transaction payload into rateless symbols and disseminates them across parallel proposer lanes, provid…
Sedna: Sharding transactions in multiple concurrent proposer blockchains
Alejandro Ranchal-Pedrosa, Benjamin Marsh, Lefteris Kokoris-Kogias +1
Modern blockchains increasingly adopt multi-proposer (MCP) consensus to remove single-leader bottlenecks and improve censorship resistance. However, MCP alone does not resolve how…
ZLB, a Blockchain Tolerating Colluding Majorities
Alejandro Ranchal-Pedrosa, Vincent Gramoli
The problem of Byzantine consensus has been key to designing secure distributed systems. However, it is particularly difficult, mainly due to the presence of Byzantine processes th…
Basilic: Resilient Optimal Consensus Protocols With Benign and Deceitful Faults
Alejandro Ranchal-Pedrosa, Vincent Gramoli
The problem of Byzantine consensus has been key to designing secure distributed systems. However, it is particularly difficult, mainly due to the presence of Byzantine processes th…
Rational Agreement in the Presence of Crash Faults
Alejandro Ranchal-Pedrosa, Vincent Gramoli
Blockchain systems need to solve consensus despite the presence of rational users and failures. The notion of -robustness has shown instrumental to list problems that cannot…
TRAP: The Bait of Rational Players to Solve Byzantine Consensus
Alejandro Ranchal-Pedrosa, Vincent Gramoli
It is impossible to solve the Byzantine consensus problem in an open network of participants if only or less of them are correct. As blockchains need to solve consensus,…
ZLB: A Blockchain to Tolerate Colluding Majorities
Alejandro Ranchal-Pedrosa, Vincent Gramoli
In the general setting, consensus cannot be solved if an adversary controls a third of the system. Yet, blockchain participants typically reach consensus "eventually" despite an ad…
Platypus: a Partially Synchronous Offchain Protocol for Blockchains
Alejandro Ranchal-Pedrosa, Vincent Gramoli
Offchain protocols aim at bypassing the scalability and privacy limitations of classic blockchains by allowing a subset of participants to execute multiple transactions outside the…