Hotstuff-1
Just one phase! HotStuff-1 offers clients early confirmations and reduces the impact of leader-slowness (MEVs) and Tail-forking attacks
Posts by Year
2024
CLVR Ordering of Transactions on AMMs
The CLVR algorithm constructs an ordering of trades which approximately minimizes price volatility with a low computational cost
2023
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.
2022
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.
2020
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
2019
Flexible Byzantine Fault Tolerance
Author: Kartik Nayak
“Concurrency” Book is Here
Today, I am proud to announce that a book I edited titled “Concurrency: The Works of Leslie Lamport” has just been published and is available on Amazon ; Go...
HotStuff: Three-Chain Rules!
Renewed interest in the Blockchain world on a long standing problem of asynchronous Byzantine Fault Tolerant (BFT) Consensus focuses on the following scaling...
Dfinty Consensus Explored
Did you ever wonder what is the BFT consensus engine that drives Dfinity, is it new or known, and how can it be improved?
2018
“Nevertheless She Persisted” Book is Here.
I was introduced to the beauty of math by my high school Russian math teacher, Mr Gershovits. He taught us not just math, but the pleasure of grappling with ...
The BFT lens: Tendermint
This is the second post discussing:
The BFT lens: HotStuff and Casper
Today I am going to overview a new algorithmic foundation called ‘HotStuff the Linear, Optimal-Resilience, One-Message BFT Devil’ (in short, HotStuff), devel...
2017
Fast Practical Byzantine Fault Tolerance is trickier than you might think
Over a decade of improvements to the seminal PBFT work have turned out to have safety or liveness issues, as demonstrated in a recent ArXiv note we posted:
Blockchain in the Lens of BFT
In the early 2000’s, a group of activists advocating the wide-spread use of cryptography and privacy-enhancing technologies were engaging over the `cypherpun...
The Greek Tragedy of Industrial Computing Research Labs
Authors: Guy Singer and Dahlia Malkhi
2016
Flexible Paxos
Summer was buzzing with intern activity at the VMware Research Group (VRG), working with all the research team and with David Tennenhouse, Chief Research Of...