Sveriges mest populära poddar
Data Skeptic
VetenskapTeknologi

Byzantine Fault Tolerant Consensus

36 min•22 december 2020

Byzantine fault tolerance (BFT) is a desirable property in a distributed computing environment. BFT means the system can survive the loss of nodes and nodes becoming unreliable. There are many different protocols for achieving BFT, though not all options can scale to large network sizes.

Ted Yin joins us to explain BFT, survey the wide variety of protocols, and share details about HotStuff.

Fler avsnitt av Data Skeptic

Visa alla avsnitt av Data Skeptic
Book Ratings and Recommendations
•39 min
Disentanglement and Interpretability in Recommender Systems
•31 min
Collective Altruism in Recommender Systems
•55 min
Niche vs Mainstream
•34 min
Healthy Friction in Job Recommender Systems
•27 min
Fairness in PCA-Based Recommenders
•50 min
Video Recommendations in Industry
•38 min
Eye Tracking in Recommender Systems
•52 min
Cracking the Cold Start Problem
•40 min
Designing Recommender Systems for Digital Humanities
•37 min

Data Skeptic med Kyle Polich finns tillgänglig på flera plattformar. Informationen på denna sida kommer från offentliga podd-flöden.