github/darkfi
1
1
Fork 0
mirror of https://github.com/darkrenaissance/darkfi.git synced 2026-04-28 03:00:18 -04:00
Code Issues Packages Projects Releases Wiki Activity

[doc/architecture/blockchain] fixed indepdendent aggregation lead selection

Browse Source
This commit is contained in:
mohab
2022-04-21 20:45:31 +02:00
parent 687ca3dd44
commit 476a201d72
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
doc/src/architecture/blockchain.md
View File

@@ -99,9 +99,9 @@ note that $(\frac{1}{v_{max}})^{n-1} < 1, V>1$, thus competing with single coin
a target function T with scalar coefficients can be formalized as
$$T=2^lk\phi(\Sigma)=2^l(\frac{1}{v_{max}})\Sigma$$
let's assume $v_{max}=2^v$, then:
$$T=2^lk\phi(\Sigma)=2^{\frac{l}{v}}\Sigma$$
$$T=2^lk\phi(\Sigma)=2^{l-v}\Sigma$$
then the lead statement is
$$y<2^{\frac{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^{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$$
### pairing leader selection independent aggregation function