Recovery Design with VRF

[torao]

Identify how VRF can be used to recover from node failure (normal or Byzantine).

[torao]

FYI: In Algorand: Scaling Byzantine Agreements for Cryptocurrencies §5.2,

If the block does not contain a valid seed (e.g., because the block was proposed by a malicious user and included invalid transactions), users treat the entire proposed block as if it were empty, and use a cryptographic hash function H (which we assume is a random oracle) to compute the associated seed for round r as seedr = H(seedr−1 ||r). The value of seed0, which bootstraps seed selection, can be chosen at random at the start of Algorand by the initial participants (after their public keys are declared) using distributed random number generation [14]. To limit the adversary’s ability