Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
0
votes
0
answers
75
views
How does PBFT tolerate Byzantine Leaders?
It is said that PBFT (or Practical Byzantine Fault Tolerance consensus) is Byzantine fault tolerant (unlike Paxos or Raft that are only Crash fault tolerant.) … If it is the case, why is it said that PBFT is Byzantine fault tolerant (in addition to Crash fault tolerant), when a Byzantine leader can always be "available", though it is an attacker node. …
0
votes
1
answer
1k
views
Difference between 2f+1, 2f and 3f+1
I am currently reading the Practical Byzantine Fault Tolerance paper. I am unable to completely understand the difference between 2f and 2f+1. …
0
votes
1
answer
2k
views
Is there a usable implementation of PBFT? [closed]
In the original Practical Byzantine Fault Tolerance (PBFT) paper they mention they implemented a fault tolerant NFS service. To do that they made a library for PBFT. Does that exist anywhere? … I am looking for something like this in the byzantine case. …
9
votes
2
answers
4k
views
Why is the commit phase in PBFT necessary?
I've read many papers and slides on Practical Byzantine Fault Tolerance (PBFT) but I'm still confused about why a COMMIT phase is required. … Most material states that
PREPARE phase ensures fault-tolerant consistent ordering of requests within views
COMMIT phase ensures fault-tolerant consistent ordering of requests across views
Some tutorial …
1
vote
0
answers
167
views
What is the difference between Proof of Elapsed Time (PoET) and Practical Byzantine Fault To...
I am interested in these two consensus algorithms in the blockchain: PoET and PBFT.
I saw this question about PBFT algorithm.
But, my questions are: what is the difference between PBFT and PoET algo …
2
votes
Accepted
Why is a threshold determined for Byzantine Fault Tolerance of an "Asynchronous" network? (w...
In Miguel Castro and Barbara Liskov's "Practical Byzantine Fault Tolerance", they achieve practical liveness with less than a third of nodes being faulty by assuming that message delays do not continue … In Ran Canetti and Tal Rabin's "Fast Asynchronous Byzantine Agreement with Optimal Resilience", they use randomness to get liveness with less than $n/3$ Byzantine node failures. …