Dynamic Proof of Stake

Overview

The DarkFi blockchain is based off proof of stake privacy focused Ouroboros Crypsinous, tunned with a discrete controller to achieve a stable supply.

Blockchain

Blockchain ${\mathbb{C}}_{loc}$ is a series of epochs: it's a tree of chains, $C^1$, $C^2$, $\dots$, $C^n$, the chain ending in a single leader per slot singls finalization.

Crypsinous Blockchain is built on top of Zerocash sapling scheme, and Ouroboros Genesis blockchain. Each participant $U_p$ stores it's own local view of the Blockchain $C_{loc}^{U_p}$. $C_{loc}$ is a sequence of blocks $B_i$ (i>0), where each $B\in C_{loc}$ $$B=(t{x}_{lead},st)$$ $$t{x}_{lead}=(LEAD,header,txs,st{x}_{proof})$$ LEAD is a magic word, header is a metadata, and txs is a vector of transaction hash (see appendix). $st{x}_{proof}=(c{m}_{\prime c},s{n}_c,ep,sl,\rho ,h,\pi )$ the Block's st is the block data, and h is the hash of that data. the commitment of the newly created coin is: $(c{m}_{c_2},r_{c_2})=COMM(p{k}^{COIN}||\tau ||v_c||{\rho }_{c_2})$, $\tau$ is slot timestamp, or index. $s{n}_c$ is the coin's serial number revealed to spend the coin. $$s{n}_c=PR{F}_{roo{t}_{sk}^{COIN}}^{sn}({\rho }_c)$$ $$\rho ={\eta }^{s{k}_{sl}^{COIN}}$$ $\eta$ is randomness from random oracle implemented as hash of previous epoch, $\rho$ id derived randomness from $\eta$. $\pi$ is the NIZK proof of the LEAD statement.

st transactions

the blockchain view is a chain of blocks, each block $B_j=(t{x}_{lead},st)$, while $st$ being the merkle tree structure of the validated transactions received through the network, that include transfer, and public transactions.

LEAD statement

for $x=(c{m}_{c_2},s{n}_{c_1},\eta ,sl,\rho ,h,ptr,{\mu }_{\rho },{\mu }_y,root)$, and $w=(path,roo{t}_{s{k}^{COIN}},pat{h}_{s{k}^{COIN}},{\tau }_c,{\rho }_c,r_{c_1},v,r_{c_2})$ for tuple $(x,w)\in L_{lead}$ iff:

• $p{k}^{COIN}=PR{F}_{roo{t}_{sk}^{COIN}}^{pk}({\tau }_c)$.
• ${\rho }_{c_2}=PR{F}_{roo{t}_{s{k}_{c_1}}^{COIN}}^{evl}({\rho }_{c_1})$. note here the nonce of the new coin is deterministically driven from the nonce of the old coin, this works as resistance mechanism to allow the same coin to be eligible for leadership more than once in the same epoch.
• $\forall i\in \{1,2\}:DeComm(c{m}_{c_i},p{k}^{COIN}||v||{\rho }_{c_i},r_{c_i})=T$.
• path is a valid Merkle tree path to $c{m}_{c_1}$ in the tree with the root root.
• $pat{h}_{s{k}^{COIN}}$ is a valid path to a leaf at position $sl-{\tau }_c$ in a tree with a root $roo{t}_{sk}^{COIN}$.
• $s{n}_{c_1}=PR{F}_{roo{t}_{sk}^{COIN}}^{sn}({\rho }_{c_1})$
• $y={\mu }_y^{roo{t}_{s{k}_{c_1}}^{COIN}||{\rho }_c}$
• $\rho ={\mu }_{\rho }^{roo{t}_{s{k}_{c_1}}^{COIN}||{\rho }_c}$
• $y<T(v)$ note that this process involves burning old coin $c_1$, minting new $c_2$ of the same value + reward.

validation rules

validation of proposed lead proof as follows:

• slot index is less than current slot index
• proposal extend from valid fork chain
• transactions doesn't exceed max limit
• signature is valid based off producer public key
• verify block hash
• verify block header hash
• public inputs ${\mu }_y$, ${\mu }_{rho}$ are hash of current consensus $\eta$, and current slot
• public inputs of target 2-term approximations ${\sigma }_1$, ${\sigma }_2$ are valid given total network stake and controller parameters
• the competing coin nullifier isn't published before to protect against double spening, before burning the coin.
• verify block transactions

Epoch

An epoch is a vector of blocks. Some of the blocks might be empty if there is no winnig leader. tokens in stake are constant during the epoch.

Leader selection

At the onset of each slot each stakeholder needs to verify if it's the weighted random leader for this slot.

$$y<T_i$$

This statement might hold true for zero or more stakeholders, thus we might end up with multiple leaders for a slot, and other times no leader. Also note that no node would know the leader identity or how many leaders are there for the slot, until it receives a signed block with a proof claiming to be a leader.

$${\varphi }_f=1-(1-f{)}^{{\alpha }_i}$$ $$T_i=L{\varphi }_f({\alpha }_i^j)$$

Note that ${\varphi }_f(1)=f$, $\text{f}$: the active slot coefficient is the probability that a party holding all the stake will be selected to be a leader. Stakeholder is selected as leader for slot j with probability ${\varphi }_f({\alpha }_i)$, ${\alpha }_i$ is $U_i$ relative stake.

see the appendix for absolute stake aggregation dependent leader selection family of functions.

automating f tuning

the stable consensus token supply is maintained by the help of discrete PID controller, that maintain stabilized occurance of single leader per slot.

control lottery f tunning paramter

$$f[k]=f[k-1]+K_{1}e[k]+K_{2}e[k-1]+K_{3}e[k-2]$$

with $k_1=k_p+K_i+K_d$, $k_2=-K_p-2K_d$, $k_3=K_d$, and e is the error function.

target T n-term approximation

target function is approximated to avoid use of power, and division in zk, since no function in the family of functions that have independent aggregation property achieve avoid it (see appendix).

target function

target fuction T: $$T=L\ast \varphi (\sigma )=L\ast (1-(1-f{)}^{\sigma })$$ $\sigma$ is relative stake. f is tuning parameter, or the probability of winning have all the stake L is field length

$\varphi (\sigma )$ approximation

$$\varphi (\sigma )=1-(1-f{)}^{\sigma }$$ $$=1-e^{\sigma ln(1-f)}$$ $$=1-(1+\sum _{n=1}^{\infty }\frac{(\sigma ln(1-f){)}^n}{n!})$$ $$\sigma =\frac{s}{\Sigma }$$ s is stake, and $\Sigma$ is total stake.

target T n term approximation

$$k=Lln(1-f{)}^1$$ $$k^{{}^{\prime }n}=Lln(1-f{)}^n$$ $$T=-[k\sigma +\frac{k^{{}^{\prime \prime }}}{2!}{\sigma }^2+\cdots +\frac{k^{{}^{\prime }n}}{n!}{\sigma }^n]$$ $$=-[\frac{k}{\Sigma }s+\frac{k^{{}^{\prime \prime }}}{{\Sigma }^{2}2!}{s}^2+\cdots +\frac{k^{{}^{\prime }n}}{{\Sigma }^{n}n!}{s}^n]$$

comparison of original target to approximation

Appendix

This section gives further details about the structures that will be used by the protocol.

Blockchain

Header

Block

LeadInfo

Public Inputs

Linear family functions

In the previous leader selection function, it has the unique property of independent aggregation of the stakes, meaning the property of a leader winning leadership with stakes $\sigma$ is independent of whether the stakeholder would act as a pool of stakes, or distributed stakes on competing coins. "one minus the probability" of winning leadership with aggregated stakes is $1-\varphi ({\sum }_i{\sigma }_i)=1-(1+(1-f{)}^{{\sigma }_i})=-(1-f{)}^{{\sum }_i{\sigma }_i}$, the joint "one minus probability" of all the stakes (each with probability $\varphi ({\sigma }_i))$ winning aggregated winning the leadership ${\prod }_i^n(1-\varphi ({\sigma }_i))=-(1-f{)}^{{\sum }_i({\sigma }_i)}$ thus: $$1-\varphi (\sum _i{\sigma }_i)=\prod _i^n(1-\varphi ({\sigma }_i))$$

A non-exponential linear leader selection can be:

$$y<T$$ $$y=2^{l}k\mid 0\le k\le 1$$ $$T=2^l\varphi (v)$$ $$\varphi (v)=\frac{1}{v_{max+}+c}v\mid c\in \mathbb{Z}$$

Dependent aggregation

Linear leader selection has the dependent aggregation property, meaning it's favorable to compete in pools with sum of the stakes over aggregated stakes of distributed stakes:

$$\varphi (\sum _i{\sigma }_i)>\prod _i^n{\sigma }_i$$ $$\sum _i{\sigma }_i>(\frac{1}{v_{max}+c}{)}^{n-1}{v}_1{v}_2\dots v_n$$ let's assume the stakes are divided to stakes of value ${\sigma }_i=1$ for $\Sigma >1\in \mathbb{Z}$, ${\sum }_i{\sigma }_i=V$ $$V>(\frac{1}{v_{max}+c}{)}^{n-1}$$ note that $(\frac{1}{v_{max}+c}{)}^{n-1}<1,V>1$, thus competing with single coin of the sum of stakes held by the stakeholder is favorable.

Scalar linear aggregation dependent leader selection

A target function T with scalar coefficients can be formalized as $$T=2^{l}k\varphi (\Sigma )=2^l(\frac{1}{v_{max}+c})\Sigma$$ let's assume $v_{max}=2^v$, and $c=0$ then: $$T=2^{l}k\varphi (\Sigma )=2^{l-v}\Sigma$$ then the lead statement is $$y<2^{l-v}\Sigma$$ for example for a group order or l= 24 bits, and maximum value of $v_{max}=2^{10}$, then lead statement: $$y<2^{14}\Sigma$$

Competing max value coins

For a stakeholder with $n{v}_{max}$ absolute stake, $\mid n\in \mathbb{Z}$ it's advantageous for the stakeholder to distribute stakes on $n$ competing coins.

Inverse functions

Inverse lead selection functions doesn't require maximum stake, most suitable for absolute stake, it has the disadvantage that it's inflating with increasing rate as time goes on, but it can be function of the inverse of the slot to control the increasing frequency of winning leadership.

Leader selection without maximum stake upper limit

The inverse leader selection without maximum stake value can be $\varphi (v)=\frac{v}{v+c}\mid c>1$ and inversely proportional with probability of winning leadership, let it be called leadership coefficient.

Decaying linear leader selection

As the time goes one, and stakes increase, this means the combined stakes of all stakeholders increases the probability of winning leadership in next slots leading to more leaders at a single slot, to maintain, or to be more general to control this frequency of leaders per slot, c (the leadership coefficient) need to be function of the slot $sl$, i.e $c(sl)=\frac{sl}{R}$ where $R$ is epoch size (number of slots in epoch).

Pairing leader selection independent aggregation function

The only family of functions $\varphi (\alpha )$ that are isomorphic to summation on multiplication $\varphi ({\alpha }_1+{\alpha }_2)=\varphi ({\alpha }_1)\varphi ({\alpha }_2)$(having the independent aggregation property) is the exponential function, and since it's impossible to implement in plonk, a re-formalization of the lead statement using pairing that is isomorphic to summation on multiplication is an option.

Let's assume $\varphi$ is isomorphic function between multiplication and addition, $\varphi (\alpha )=\varphi (\frac{\alpha }{2})\varphi (\frac{\alpha }{2})=\varphi (\frac{\alpha }{2}{)}^2$, thus: $$\varphi (\alpha )=\underset{\text{α}}{\underbrace{\varphi (1)\dots \varphi (1)}}=\varphi (1{)}^{\alpha }$$ then the only family of functions $\varphi :\mathbb{R}\to \mathbb{R}$ satisfying this is the exponential function $$\varphi (\alpha )=c^{\alpha }\mid c\in \mathbb{R}$$

no solution for the lead statement parameters, and constants $S,f,\alpha$ defined over group of integers.

assume there is a solution for the lead statement parameters and constants $S,f,\alpha$ defined over group of integers. for the statement $y<T$, $$T=L{\varphi }_{max}\varphi (\alpha )=S\varphi (\alpha )$$ $$S=ord(G){\varphi }_{max}\varphi (\alpha )$$ such that S $inZ$ ${\varphi }_{max}=\varphi ({\alpha }_{max})$ where ${\alpha }_{max}$ is the maximum stake value being $2^{64}$, following from the previous proof that the family of function haveing independent aggregation property is the exponential function $f^{\alpha }$, and $f\in Z|f>1$, the smallest value satisfying f is $f=2$, then $${\varphi }_{max}=2^{2^{64}}$$ note that since $ord(G)<<{\varphi }_{max}$ thus $S<<1$, contradiction.

Leaky non-resettable beacon

Built on top of globally synchronized clock, that leaks the nonce $\eta$ of the next epoch a head of time (thus called leaky), non-resettable in the sense that the random nonce is deterministic at slot s, while assuring security against adversary controlling some stakeholders.

For an epoch j, the nonce ${\eta }_j$ is calculated by hash function H, as:

$${\eta }_j=H({\eta }_{j-1}||j||v)$$

v is the concatenation of the value $\rho$ in all blocks from the beginning of epoch $e_{i-1}$ to the slot with timestamp up to $(j-2)R+\frac{16k}{1+ϵ}$, note that k is a persistence security parameter, R is the epoch length in terms of slots.

toward better decentralization in ouroboros

the randomization of the leader selection at each slot is hinged on the random $y$, ${\mu }_y$, ${\rho }_c$, those three values are dervied from $\eta$, and root of the secret keys, the root of the secret keys for each stakeholder can be sampled, and derived beforehand, but $\eta$ is a response to global random oracle query, so it's security is hinged on $\text{centralized global random node}$.

solution

to break this centeralization, a decentralized emulation of $G_{ro}$ functionality for calculation of: ${\eta }_i=PR{F}_{{\eta }_{i-1}}^{G_{ro}}(\psi )$ $$\psi =hash(t{x}_0^{ep})$$ $${\eta }_0=hash("let\mathrm{there}\mathrm{be}\mathrm{dark}!")$$ note that first transaction in the block, is the proof transaction.