Algorithmcore
Signed messages algorithm
Also called SM(m).
Byzantine agreement using signatures, tolerating any number of faults below n.
Byzantine agreement using signatures, tolerating any number of faults below n.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag XR29FE Edit this page History Report an error