Hotstuff-1
Just one phase! HotStuff-1 offers clients early confirmations and reduces the impact of leader-slowness (MEVs) and Tail-forking attacks
Just one phase! HotStuff-1 offers clients early confirmations and reduces the impact of leader-slowness (MEVs) and Tail-forking attacks
The CLVR algorithm constructs an ordering of trades which approximately minimizes price volatility with a low computational cost
BFT consensus that achieves optimal worst-case communication complexity (quadratic) with constant expected latency
Revisitng HotStuff, it turns out that two phases are enough after all.
Byzantine Generals with Unknown/Fluctuating Participation extended to tolerate to Minority Corruption.
A full solution for Byzantine Atomic Broadcast with instant finality when there is an unknown and dynamic set of active nodes.
a simple solution for reaching agreement with instant finality when there is an unknown and dynamic set of active nodes
This post describes how to integrate “Order-Fairness” into DAG-based BFT Consensus protocols to prevent BEV exploits
A parallel execution engine enforcing block pre-ordering, combined with on-the-fly optimistic Software Transactional Memory.
Capturing Byzantine Attacks
Author: Kartik Nayak
Renewed interest in the Blockchain world on a long standing problem of asynchronous Byzantine Fault Tolerant (BFT) Consensus focuses on the following scaling...
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...
This post describes how to integrate “Order-Fairness” into DAG-based BFT Consensus protocols to prevent BEV exploits
This post describes a simple and efficient DAG-based BFT Consensus embedding – quite possibly the simplest way to build BFT Consensus in a DAG.
In this post, we explore Streamlet and some gaps it leaves.
Did you ever wonder what is the BFT consensus engine that drives Dfinity, is it new or known, and how can it be improved?
This is the second post discussing:
Today I am going to overview a new algorithmic foundation called ‘HotStuff the Linear, Optimal-Resilience, One-Message BFT Devil’ (in short, HotStuff), devel...
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...
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...
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 ...
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:
An evolution of “Pacemaker” solutions to the Byzantine View Synchronization problem finally led to optimal communication-complexity solutions.
Paradigms for high-throughput transaction execution over a DAG, meeting recent advances in scaling core Consensus ordering protocols in blockchains.
Authors: Guy Singer and Dahlia Malkhi