Logo

    α-consensus β-reward scheme for hybrid Stake-Space consensus

    Creator
    Created
    Mar 18, 2023 9:31 PM

    Goal

    A consensus and reward distribution scheme with two tunable parameters trading off between Stake or Space secured consensus and rewards.

    The α∈[0,1]\alpha \in [0, 1]α∈[0,1] parameter defines whether the consensus is secured by Stake or Space.

    The β∈[0,1]\beta \in [0, 1]β∈[0,1] parameter defines the share of rewards distributed towards Stake and Space.

    • α=β=0\alpha = \beta = 0α=β=0: results in a pure Proof of Stake, where the Space doesn’t benefit consensus participants.
    • α=β=1\alpha = \beta = 1α=β=1: results in a pure Proof of Space, where the Stake doesn’t benefit consensus participants.
    • {α=0,β=1}\{\alpha = 0, \beta = 1\}{α=0,β=1} and {α=1,β=0}\{\alpha = 1, \beta = 0\}{α=1,β=0} are degenerate cases which do not reward consensus participant.

    Definitions

    • ϙstakeϙ_{\textrm{stake}}ϙstake​ - share of the stake for given participant
    • ϙspaceϙ_{\textrm{space}}ϙspace​ - share of the space for given participant
    • E[ϙreward ∣ winner]E[ϙ_{\textrm{reward}}\ |\ \textrm{winner}]E[ϙreward​ ∣ winner] - share of the target block reward transferred to a participant given that they won a block
    P(winner)=(1−α)⋅ϙstake+α⋅ϙspaceE[ϙreward]=(1−β)⋅ϙstake+β⋅ϙspaceE[ϙreward]=E[ϙreward ∣ winner]⋅P(winner)E[ϙreward ∣ winner]=E[ϙreward]P(winner)E[ϙreward ∣ winner]=(1−β)⋅ϙstake+β⋅ϙspace(1−α)⋅ϙstake+α⋅ϙspace\begin{align} P(\textrm{winner}) &= (1-\alpha) \cdot ϙ_{\textrm{stake}} + \alpha \cdot ϙ_{\textrm{space}} \\ E[ϙ_{\textrm{reward}}] &= (1-\beta) \cdot ϙ_{\textrm{stake}} + \beta\cdot ϙ_{\textrm{space}} \\ E[ϙ_{\textrm{reward}}] &= E[ ϙ_{\textrm{reward}}\ |\ \textrm{winner} ] \cdot P(\textrm{winner} ) \\ E[ ϙ_{\textrm{reward}}\ |\ \textrm{winner} ] &= \frac{E[ϙ_{\textrm{reward}}]}{P(\textrm{winner})} \\ E[ ϙ_{\textrm{reward}}\ |\ \textrm{winner} ] &= \frac{(1-\beta) \cdot ϙ_{\textrm{stake}} + \beta\cdot ϙ_{\textrm{space}}}{(1-\alpha) \cdot ϙ_{\textrm{stake}} + \alpha \cdot ϙ_{\textrm{space}}} \end{align}P(winner)E[ϙreward​]E[ϙreward​]E[ϙreward​ ∣ winner]E[ϙreward​ ∣ winner]​=(1−α)⋅ϙstake​+α⋅ϙspace​=(1−β)⋅ϙstake​+β⋅ϙspace​=E[ϙreward​ ∣ winner]⋅P(winner)=P(winner)E[ϙreward​]​=(1−α)⋅ϙstake​+α⋅ϙspace​(1−β)⋅ϙstake​+β⋅ϙspace​​​​

    Equations 1 and 2 define the two primary goals of the scheme, securing the protocol (by selecting winners) depending on the α\alphaα and giving out rewards depending on β\betaβ.

    Equations 3, 4 and 5 derive the share of the block reward that a given participant should receive when they win a block. When α=β\alpha = \betaα=β the E[ϙreward ∣ winner]E[ϙ_{\textrm{reward}}\ |\ \textrm{winner}]E[ϙreward​ ∣ winner] is equal to 111. Equations 4 and 5 are sound, as division by zero cannot arise because the participant cannot win a block.

    CryptoNet is a Protocol Labs initiative.