Akilesh Tangella
Akilesh Tangella
Let $g$ be the generator of some group $\mathbb{G}$ for which the discrete logarithm problem is hard. The note formed from deposit $i$ will store the polynomial $r_i (x -...
Right now, inside the claims circuit we are calculating anonymity points reward as: `rate * (time in the MASP in milliseconds) * maspRecordAmount`. This amount can easily exceed 248 bits,...
What happens if we don't verify that $A_{0}^{(a)} = tpk_{(a)}^{old}$ in step 2 of the FS-DKR protocol? Also why does $tpk$, the group public key stay the same from FS-DKG...