Skip to content

Commit 064ab69

Browse files
committed
fix formatting
1 parent 4a0993b commit 064ab69

File tree

1 file changed

+6
-6
lines changed

1 file changed

+6
-6
lines changed

pages/home/oracle-integrity-staking/examples.mdx

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -122,15 +122,15 @@ In this scenario, let's assume that
122122

123123
- The constant parameter representing the target stake per symbol $M$ is 100
124124
- The constant parameter to control cap contribution $Z$ is 5
125-
- Current symbols published $n_p$ = 5 where for every symbol currently published $n_s$ = 5
125+
- Current symbols published are $\{$s*{1}$,.., $s*{5}$\}$ where for every symbol currently published $n_s$ = 5 (for i = 1 .. 5 $n_{s_i}$ = 5)
126126

127127
The cap of the pool is calculated as follows:
128128

129129
$$
130130
\begin{aligned}
131-
\quad{C_p} &= M \cdot \sum_{s \in \text{\{s\_1,.., s\_5\}}} \frac{1}{\max(n_s, Z)} \\
132-
&= 100 \cdot \sum_{s \in \text{\{s\_1,.., s\_5\}}} \frac{1}{\max(5, 5)} \\
133-
&= 100 \cdot \sum_{s \in \text{\{s\_1,.., s\_5\}}} \frac{1}{5} \\
131+
\quad{C_p} &= M \cdot \sum_{s \in \text{\{$s_{1}$,.., $s_{5}$\}}} \frac{1}{\max(n_s, Z)} \\
132+
&= 100 \cdot \sum_{s \in \text{\{$s_{1}$,.., $s_{5}$\}}} \frac{1}{\max(5, 5)} \\
133+
&= 100 \cdot \sum_{s \in \text{\{$s_{1}$,.., $s_{5}$\}}} \frac{1}{5} \\
134134
&= 100 \cdot 1 = 100 \\
135135
\end{aligned}
136136
$$
@@ -155,11 +155,11 @@ $$
155155

156156
Assuming there is room to publish 5 more symbols $\{s_6, .., s_{10}\}$ where each have currently 9 publishers ( for i = 6 .. 10 $n_{s_i}$ = 9)
157157

158-
The new pool cap would change as the sum of the current cap from the 5 symbols published plus the cap gained from publishing the additional symbols $\{s_6, .., s_{10}\}$ (where for i = 6 .. 10 $n_{s_i}$ = 10)
158+
The new pool cap would change as the sum of the current cap from the 5 symbols published plus the cap gained from publishing the additional symbols $\{$s*{6}$,.., $s*{10}$\}$ (where for i = 6 .. 10 $n_{s_i}$ = 10)
159159

160160
$$
161161
\begin{aligned}
162-
C_{p_{option2}} &= 100 + 100 \cdot \sum_{s \in \text{\{s\_1,.., s\_5, s\_6,.., s\_{10}\}}} \frac{1}{\max(10, 5)} \\
162+
C_{p_{option2}} &= 100 + 100 \cdot \sum_{s \in \text{\{$s_{6}$,.., $s_{10}$\}}} \frac{1}{\max(10, 5)} \\
163163
&= 100 + 100 \cdot 5 \cdot \frac{1}{10} \\
164164
&= 100 + 50 = 150
165165
\end{aligned}

0 commit comments

Comments
 (0)