@@ -7,11 +7,12 @@ sidebar_class_name: hidden
7
7
## Context
8
8
9
9
A decentralized service is a service provided by a set of separate autonomous
10
- participants that are not subject to a hierarchy. Of the network of
11
- participants, the majority share a common purpose of providing a good service.
12
- However, some participants may be incompetent or even have malign intent. This
13
- network of mutually suspicious participants must coordinate the running of a
14
- distributed service.
10
+ participants that are not subject to a hierarchy. Within the network of
11
+ participants, the majority share the common purpose of providing a good service.
12
+ However, some participants may be incompetent or even have malign intent.
13
+ Because of this possibility, each is suspicious of the others. This network of
14
+ mutually suspicious participants must coordinate the running of a distributed
15
+ service.
15
16
16
17
Part of an overall design of such a system is providing tooling which enables
17
18
them to reach agreement over various network related tasks; this is consensus.
@@ -24,18 +25,26 @@ The following will seek to assess the economic implications for Orcfax as it
24
25
continues research and development into maturing its decentralized network of
25
26
validator nodes, known as EchoNet, through the integration of staking and
26
27
consensus mechanisms. Where necessary, specific considerations relating to
27
- staking and consensus in terms of economic impacts will be addressed separately.
28
+ staking and consensus in terms of economic impacts will be addressed separately,
29
+ however the two mechanisms share considerable overlap in terms of economic
30
+ considerations; for this reason, unless addressed separately, the following
31
+ applies to both.
28
32
29
33
## Use cases
30
34
31
35
Projects which may benefit from the catalyst project deliverables, from either
32
- consensus or staking, may be any which require a set of participants to provide
33
- a service on behalf of the project in a decentralized manner; the design of the
34
- consensus and staking proof of concepts continue to be executed in such a way
35
- that while in context of this proposal, the service provision is an oracle, it
36
- need not be as this aspect is off-chain.
37
-
38
- The deliverables from these projects have broad utility and may be used by
36
+ the consensus or staking proposals, may be any which require a set of
37
+ participants to provide a service on behalf of the project in a decentralized
38
+ manner; the design of the consensus and staking proof of concepts continue to be
39
+ executed in such a way that while in context of this proposal, the service
40
+ provision is an oracle, it need not be as this aspect is off-chain.
41
+
42
+ Each PoC also black-boxes the other, so while the Orcfax use case will utilize
43
+ both a staking and consensus mechanism, others may choose to leverage them
44
+ independently.
45
+
46
+ Our team has elected to design these PoC's in this fashion because we understand
47
+ that The deliverables from these projects have broad utility and may be used by
39
48
projects offering diverse services to their users.
40
49
41
50
### Specific considerations for Staking
@@ -55,19 +64,20 @@ participants are able to reach consensus on these accounts and produce a
55
64
signature/signatures as proof of general acceptance. This happens periodically -
56
65
say once every 24 hours.
57
66
58
- The rewards are paid out from a 'treasury' and forfeit funds are paid to the
59
- treasury. The currency is a native asset. The project output should include the
60
- scripts governing these aspects of the treasury. Other funding of the treasury
61
- is beyond project scope. We will assume the treasury is sufficiently funded to
62
- meet the burden of conveying rewards.
67
+ The rewards for good behaviour and service are paid out from a 'treasury' and
68
+ forfeit funds are paid to the treasury. The currency will be a native asset. The
69
+ project output should include the scripts governing these aspects of the
70
+ treasury. Other funding of the treasury is beyond project scope. We will assume
71
+ the treasury is sufficiently funded to meet the burden of conveying rewards.
63
72
64
- ## Staking
73
+ ## Orcfax staking: rewarding good behaviour
65
74
66
75
Orcfax is an aspiring decentralized Oracle service. To participate within the
67
76
network, a participant must be in possession of two types of Cardano native
68
77
assets:
69
78
70
- One Orcfax Validator License, one of 100 NFTs At least 500,000 \$ FACT
79
+ - One Orcfax Validator License, one of 100 NFTs
80
+ - At least 500,000 \$ FACT
71
81
72
82
Participants are strongly discouraged from behaving badly through the use of
73
83
slashing. A participant must first put 'at stake' some asset(s). If the
@@ -77,25 +87,33 @@ through a slashing mechanism.
77
87
To incentivize good behavior, a participant receives rewards proportionate to
78
88
their good service.
79
89
80
- However, when balancing incentives and penalties for participants care must be
90
+ However, when balancing incentives and penalties for participants, care must be
81
91
taken. The wrong incentive structure may either:
82
92
83
- cause a race to the top. Rewards only go to a few participants. Eventually this
84
- leads to centralization which degrades robustness. cause a race to the bottom.
85
- Participants are rewarded even if they are poor service providers.
93
+ - cause a race to the top. Rewards only go to a few participants. Eventually
94
+ this leads to centralization which degrades robustness.
95
+ - cause a race to the bottom. Participants are rewarded even if they are poor
96
+ service providers.
86
97
87
98
Both are bad for the long term health of the service.
88
99
89
100
### Components overview
90
101
91
- There are the following key components of the consensus PoC:
102
+ The following are the key components of the consensus PoC:
92
103
93
104
1 . Constitution - holds the signing key.
94
105
1 . Hold - rewards awaiting collection.
95
106
1 . Safe - locks a participants funds.
96
107
1 . Treasury - holds funds awaiting dispensing.
97
108
1 . Dispenser - manages the dispensing of rewards.
98
109
110
+ ::: info [ N.B.]
111
+
112
+ The following sections will be updated to reflect final design decisions made in
113
+ milestone 3.
114
+
115
+ :::
116
+
99
117
#### The Constitution
100
118
101
119
The constitution holds any dynamic data required by the protocol. This is a
@@ -176,13 +194,13 @@ it belongs.
176
194
177
195
The dispenser facilitates the dispensing of rewards to the ` Hold ` .
178
196
179
- ## Consensus
197
+ ## Orcfax validators: reaching L2 consensus
180
198
181
199
The economics of consensus look quite different. The focus here is in
182
200
understanding the cost of validator participation, the cost to a validator when
183
201
slashed, and the potential benefits of performing maliciously. If the potential
184
- profit of providing bad information outweighs the cost, validator nodes would be
185
- financially advantageous to act badly and there would be significant risk to
202
+ profit of providing bad information outweighs the cost, validator nodes become
203
+ financially incentivized to act badly, which would result in significant risk to
186
204
network integrity.
187
205
188
206
At the time of this writing, the cost of acquiring 500,000 FACT tokens is
@@ -191,7 +209,7 @@ License is 10,500 ADA or 11,653 USD. This means that the cumulative stake
191
209
required to participate has a value of approximately 17,230 USD.
192
210
193
211
In order to combat the risks associated with validators having financial
194
- advantage to act badly, Orcfax is tasked with devising a strategy by which
212
+ incentive to act badly, Orcfax is tasked with devising a strategy by which
195
213
malicious behavior becomes cost prohibitive or disadvantageous. However, at this
196
214
stage of research and development, Orcfax has not yet decided on the process
197
215
through which consensus will be reached over a given fact statement; the
@@ -201,21 +219,22 @@ behavior may need to be addressed. For this reason, we will explore two options:
201
219
the network verifies that statement; 2.) where all nodes within a randomly
202
220
selected subset propose a statement, and the median entry is selected.
203
221
204
- In the first, where a proposer has their statements verified by a subset of n
205
- nodes, then the cost of the lie (using the values given above) becomes
206
- $n * 17,230$ USD. So, in a system where the threshold for verification was 10
207
- nodes, then the cost of the lie is more than 170,000 USD.
222
+ In the first, where a proposer has their statements verified by a subset of $n$
223
+ nodes, the cost of the lie (using the values given above) becomes $n * 17,230$
224
+ USD. So, in a system where the threshold for verification was 10 nodes, the cost
225
+ of the lie is more than 170,000 USD.
208
226
209
- However, if instead of requiring any subset for verification we had the n nodes
210
- selected at random, then the lie becomes significantly more expensive as even If
211
- the bad actor corrupted 10 of the total 100 nodes, it would be very unlikely
212
- those 10 would be randomly selected.
227
+ However, if instead of requiring any subset for verification we had the $n$
228
+ nodes selected at random, then the lie becomes significantly more expensive.
229
+ With random selection of subset nodes, even If the bad actor corrupted 10 of the
230
+ total 100 nodes, it still becomes very unlikely that those 10 would be randomly
231
+ selected.
213
232
214
- In the second where a subset of nodes is randomly selected, each proposes a
215
- statement, and the median is selected, then the cost of the lie at a minimum is
216
- $((n + 1) / 2) * 17,230$ USD or the value of half the selected nodes +1. So in a
217
- case where, from 100 nodes, a subset of 21 are selected at random, the cost of
218
- the lie would be nearly 190,000 USD.
233
+ In the second scenario where a subset of nodes is randomly selected, each
234
+ proposes a statement, and the median is selected, the cost of the lie at a
235
+ minimum is $((n + 1) / 2) * 17,230$ USD or the value of half the selected nodes
236
+ +1. So in a case where, from 100 nodes, a subset of 21 are selected at random,
237
+ the cost of the lie would be nearly 190,000 USD.
219
238
220
239
But again, the fact that this subset of nodes is selected at random means that
221
240
these costs are the minimum. Even with a bad actor having at least 11 licenses,
@@ -224,14 +243,21 @@ propose within the subset is very slim.
224
243
225
244
For either of the above scenarios, the value of \$ FACT and cost of acquiring a
226
245
Validator License have immense impact on the appropriate size of the subset of
227
- nodes; It could very well be that, using the values given previously, it's
246
+ nodes; it could very well be that, using the values given previously, it's
228
247
necessary to select a subset of 21 (or more) nodes in order to adequately reduce
229
- the risk of bad actors and to make bad data cost prohibitive. However, this
248
+ the risk of bad actors and to make bad bahaviour cost prohibitive. However, this
230
249
narrative dramatically changes should \$ FACT halve in value, or increase 10x.
231
250
232
- These are all considerations thatOrcfax must weigh as we continue to develop a
251
+ These are all considerations that Orcfax must weigh as we continue to develop a
233
252
consensus solution.
234
253
254
+ ::: info [ N.B.]
255
+
256
+ This section will be updated to reflect final design decisions made in
257
+ milestone 3.
258
+
259
+ :::
260
+
235
261
## Participation costs
236
262
237
263
Participants will need to shoulder the cost of either acquiring their own
@@ -247,9 +273,9 @@ the total cost of participation for validators.
247
273
::: info [ N.B.]
248
274
249
275
The cost of implementing and running staking and consensus mechanisms remains
250
- unknown because design choices relating to either can have significant impacts.
251
- This section will be updated after the next milestone and the completion of the
252
- PoC's.
276
+ unknown because design choices relating to either can have significant impacts;
277
+ final design takes place in the following milestone. This section will be
278
+ updated after the next milestone and the completion of the PoC's.
253
279
254
280
:::
255
281
0 commit comments