Skip to content

Commit b65bd56

Browse files
committed
added example 6
1 parent 8e77510 commit b65bd56

File tree

1 file changed

+56
-0
lines changed

1 file changed

+56
-0
lines changed

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

Lines changed: 56 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -109,6 +109,62 @@ $$
109109

110110
In this example, the stake is uniformly slashed by 5\%, affecting both the publisher and the delegator. Slashing impact the total stake into the pool, regardless of the Cap.
111111

112+
## Example 6: Increasing the cap of the pool
113+
114+
This example shows how a publisher can increase the cap of the pool assigned to them.
115+
As described in the [Mathematical Representation](/home/pyth-token/oracle-integrity-staking/mathematical-representation#pool-cap), the cap is caluclated as:
116+
117+
$$
118+
\large{{\bold{C_p}} = M \cdot \sum_{s \in \text{Symbols\_p}} \frac{1}{\max(n_s, Z)}}
119+
$$
120+
121+
In this scenario, let's assume that
122+
123+
- The constant parameter representing the target stake per symbol $M$ is 100
124+
- 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
126+
127+
The cap of the pool is calculated as follows:
128+
129+
$$
130+
\begin{aligned}
131+
\quad{C_p} &= M \cdot \sum_{s \in \text{Symbols\_p}} \frac{1}{\max(n_s, Z)} \\
132+
&= 100 \cdot \sum_{s \in \text{Symbols\_p}} \frac{1}{\max(5, 5)} \\
133+
&= 100 \cdot \sum_{s \in \text{Symbols\_p}} \frac{1}{5} \\
134+
&= 100 \cdot 1 = 100 \\
135+
\end{aligned}
136+
$$
137+
138+
Here publisher has 2 options to increase the cap of the pool assigned to it.
139+
140+
### Option 1: Publish new symbol with low number of publishers
141+
142+
Assume the publisher decides to publish a new symbol with only 3 publishers, $n_{s_{low}}$ = 3.
143+
144+
The new pool cap would change as the sum of the current cap from the 5 symbols published plus the cap gained from publishing $s_{low}$ (where $n_{s_{low}}$ = 3 + 1 = 4)
145+
146+
$$
147+
\begin{aligned}
148+
C_{p_{option1}} &= 100 + 100 \cdot \frac{1}{\max(4, 5)} \\
149+
&= 100 + 100 \cdot \frac{1}{5} \\
150+
&= 100 + 20 = 120
151+
\end{aligned}
152+
$$
153+
154+
### Option 2: Publish additional symbols where cap of 32 publishers is not reached
155+
156+
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)
157+
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)
159+
160+
$$
161+
\begin{aligned}
162+
C_{p_{option2}} &= 100 + 100 \cdot \sum_{s \in \text{\{s\_6,.., s\_{10}\}}} \frac{1}{\max(10, 5)} \\
163+
&= 100 + 100 \cdot 5 \cdot \frac{1}{10} \\
164+
&= 100 + 50 = 150
165+
\end{aligned}
166+
$$
167+
112168
## Reward Calculator
113169

114170
Use the calculator below to calculate publisher and delegator rewards based on your inputs.

0 commit comments

Comments
 (0)