Hotstuff-1
Just one phase! HotStuff-1 offers clients early confirmations and reduces the impact of leader-slowness (MEVs) and Tail-forking attacks
Recent Posts
CLVR Ordering of Transactions on AMMs
The CLVR algorithm constructs an ordering of trades which approximately minimizes price volatility with a low computational cost
Optimal Latency and Communication SMR View-Synchronization
BFT consensus that achieves optimal worst-case communication complexity (quadratic) with constant expected latency
HotStuff-2: Optimal Two-Phase Responsive BFT
Revisitng HotStuff, it turns out that two phases are enough after all.
The Latest View on View Synchronization
An evolution of “Pacemaker” solutions to the Byzantine View Synchronization problem finally led to optimal communication-complexity solutions.
Minority Corruption Resilience in Byzantine Generals With Unknown and Fluctuating Participation
Byzantine Generals with Unknown/Fluctuating Participation extended to tolerate to Minority Corruption.
Instant Finality in Byzantine Atomic Broadcast under Unknown/Dynamic Participation
A full solution for Byzantine Atomic Broadcast with instant finality when there is an unknown and dynamic set of active nodes.
Instant Finality in Byzantine Generals with Unknown and Dynamic Participation
a simple solution for reaching agreement with instant finality when there is an unknown and dynamic set of active nodes
Execution and Parallelism for DAG-based BFT Consensus
Paradigms for high-throughput transaction execution over a DAG, meeting recent advances in scaling core Consensus ordering protocols in blockchains.
Another Advantage of DAG-based BFT: BEV Resistance
This post describes how to integrate “Order-Fairness” into DAG-based BFT Consensus protocols to prevent BEV exploits
On BFT Consensus Evolution: From Monolithic to DAG
This post describes a simple and efficient DAG-based BFT Consensus embedding – quite possibly the simplest way to build BFT Consensus in a DAG.
Block-STM: Accelerating Smart-Contract Processing
A parallel execution engine enforcing block pre-ordering, combined with on-the-fly optimistic Software Transactional Memory.
What They Did not Teach you in Streamlet
In this post, we explore Streamlet and some gaps it leaves.
Twins: Making BFT Systems Robust
Capturing Byzantine Attacks
Flexible Byzantine Fault Tolerance
Author: Kartik Nayak