logos-co
/
roadmap
mirror of https://github.com/logos-co/roadmap.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

added details to logosbft overview

This commit is contained in:
Corey 2022-10-28 16:49:55 -04:00
parent 6558c2c89f
commit c9e0b5fdb4
1 changed files with 8 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
content/roadmap/consensus/candidates/logos-bft/overview.md
View File

@ -17,17 +17,20 @@ Logos BFT is a [consensus](/consensus/index.md) candidate for the Logos Network
An ongoing survey of the current state of the art around Consensus Mechanisms and their peripheral dependencies is beign conducted by Tuanir, and can be found in the following WIP Overleaf document:
- [WIP Consensus SoK](https://www.overleaf.com/project/633acc1acaa6ffe456d1ab1f)
### Committee Overlay Structure
### Committee Tree Overlay
The basis of LogosBFT is dependent upon establishing an committee overlay tree structure for message distribution.
An overview video can be found in the following link:
- [LogosBFT Overview by Moh during Offsite](https://drive.google.com/file/d/17L0JPgC0L1ejbjga7_6ZitBfHUe3VO11/view?usp=sharing)
The details of this are being worked on by Moh and Alexander and can be found in the following overleaf documents:
- [Moh's newer draft](https://www.overleaf.com/project/6341fb4a3cf4f20f158afad3)
- [Moh's original draft](https://www.overleaf.com/read/rhtnjxtjqnhp)
- [Moh's draft](https://www.overleaf.com/project/6341fb4a3cf4f20f158afad3)
- [Alexander's notes on the statistical properties of committees](https://www.overleaf.com/project/630c7e20e56998385e7d8416)
#### Failure Recovery
There exists a timeout that triggers an overlay reconfiguration. Currently work is being done to calculate the probabilities of another failure based on a given percentage of byzantine nodes within the network.
- [Recovery Failure Probabilities]() - LINK TO WORK HERE
### Random Beacon
A random beacon is required to choose a leader and establish a seed for defining the overlay tree. Marcin is working on the various avenues. His previous presentations can be found in the following presentation slides:
- [Intro to Multiparty Random Beacons](https://cloud.logos.co/index.php/s/b39EmQrZRt5rrfL)
@ -36,4 +39,5 @@ A random beacon is required to choose a leader and establish a seed for defining
### Erasure Coding (LT Codes / Fountain Codes / Raptor Codes)
In order to reduce message complexity during propagation, we are investigating the use of Luby Transform (LT) codes, more specifically [Fountain Codes](https://en.wikipedia.org/wiki/Fountain_code), to break up the block to be propagated to validators and recombined by local peers within a committee.
- [LT Code implementation in Rust](https://github.com/chrido/fountain) - unclear about legal status of LT or Raptor Codes, it is currently under investigation.
- [LT Code implementation in Rust](https://github.com/chrido/fountain) - unclear about legal status of LT or Raptor Codes, it is currently under investigation.