3 citations · 6 across the 11 of their papers we have counts for
6 papers · 1 filter
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…