From 687ca3dd447bb91def022f51eb2b9ed2e519c4fb Mon Sep 17 00:00:00 2001 From: mohab Date: Wed, 20 Apr 2022 15:19:09 +0200 Subject: [PATCH] [doc/architecture/blockchain] fixed some typos --- doc/src/architecture/blockchain.md | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/doc/src/architecture/blockchain.md b/doc/src/architecture/blockchain.md index dd3ab3749..e4c68a0d2 100644 --- a/doc/src/architecture/blockchain.md +++ b/doc/src/architecture/blockchain.md @@ -76,7 +76,7 @@ independent aggregation of the stakes, meaning the property of a leader winning $1-\phi(\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 $\phi(\sigma_i))$ winning aggregated winning the leadership -$\prod_{i}^{n}(1-\phi(\sigma_i))=-(1-f)^{\sum_{\sigma_i}}$ +$\prod_{i}^{n}(1-\phi(\sigma_i))=-(1-f)^{\sum_i(\sigma_i)}$ thus: $$ 1-\phi(\sum_{i}\sigma_i) =\prod_{i}^{n}(1-\phi(\sigma_i)) $$ @@ -104,7 +104,8 @@ note that $(\frac{1}{v_{max}})^{n-1} < 1, V>1$, thus competing with single coin $$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^{14}\Sigma$$ - +### pairing leader selection independent aggregation function +TODO ## Leaky non-resettable beacon