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
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.
A parallel execution engine enforcing block pre-ordering, combined with on-the-fly optimistic Software Transactional Memory.
In this post, we explore Streamlet and some gaps it leaves.
Capturing Byzantine Attacks
Author: Kartik Nayak
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...
Renewed interest in the Blockchain world on a long standing problem of asynchronous Byzantine Fault Tolerant (BFT) Consensus focuses on the following scaling...
Did you ever wonder what is the BFT consensus engine that drives Dfinity, is it new or known, and how can it be improved?
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 ...
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...
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:
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...
Authors: Guy Singer and Dahlia Malkhi