You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: site/docs/faq.md
+12-12Lines changed: 12 additions & 12 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -8,13 +8,13 @@ sidebar_position: 6
8
8
9
9
Ouroboros Leios is a next-generation blockchain consensus protocol designed to improve transaction throughput and reduce latency by using a pipelined endorsing process. It builds upon the core Ouroboros principles (as used by Cardano), introducing separate input blocks (IBs) for transactions and endorser blocks (EBs) that reference those transactions, thus enhancing scalability.
10
10
11
-
## What are the key benefits of Leios compared with traditional Ouroboros?
11
+
## What are the key benefits of Leios over other Ouroboros protocols?
12
12
13
13
Leios offers several significant advantages:
14
14
15
15
-**Higher throughput and lower latency.** By splitting transaction processing into IB and EB stages, Leios handles more transactions in parallel.
16
16
-**Flexible diffusion strategies.** Nodes can choose different block-propagation methods, such as 'freshest-first' or 'oldest-first.'
17
-
-**Enhanced cryptography.** Leios uses BLS (Boneh–Lynn–Shacham) signatures for aggregated verification and verifiable random functions (VRFs) for leader selection.
17
+
-**Enhanced cryptography.** Leios uses Boneh–Lynn–Shacham (BLS) signatures for aggregated verification and verifiable random functions (VRFs) for leader selection.
18
18
-**Robust simulations and formal methods.** Rust and Haskell simulations measure real-world performance, and executable specifications help ensure correctness.
19
19
-**Scalable cost model.** A cost calculator enables node operators to estimate expenses (for example, storage amortization and CPU usage).
20
20
@@ -47,11 +47,11 @@ Leios supports multiple strategies for propagating blocks and votes:
47
47
48
48
-**Oldest-first:** prioritizes older blocks or transactions
49
49
-**Freshest-first:** focuses on the newest blocks or transactions first
50
-
-**Peer-order:** requests blocks in the order peers announce them
50
+
-**Peer-order:** requests blocks in the order peers announce them.
51
51
52
52
Your choice of strategy can affect latency, network load, and overall throughput.
53
53
54
-
## Can the system be sharded or self-regulate?
54
+
## Can the system be sharded or self-regulated?
55
55
56
56
Not in its current design. Every node validates the entire chain. Thus, adding more nodes does not inherently increase throughput in the same way sharded protocols do. The community votes on protocol parameters (for example, block size), and the system's load is the same for all. Future research may explore sharding, but it is not yet part of Leios.
57
57
@@ -72,7 +72,7 @@ Leios provides an online cost calculator that considers:
72
72
-**CPU usage and the number of cores**
73
73
-**Bandwidth consumption**
74
74
-**Storage** (including the default assumption of 50% disk compression)
75
-
-**Perpetual storage cost amortization**
75
+
-**Perpetual storage cost amortization**.
76
76
77
77
It also supports hyperscale and discount cloud providers. For example, you can model single-relay or multi-relay deployments at variable bandwidths.
78
78
@@ -83,7 +83,7 @@ Two primary simulation frameworks (Rust and Haskell) are maintained to:
83
83
- Test network topologies and measure real or simulated latencies (using the DeltaQ model)
84
84
- Evaluate CPU usage for blocks and transactions under varying loads
85
85
- Visualize block diffusion (IBs, EBs, and RBs) using different strategies
86
-
- Compare ideal conditions vs realistic mainnet-like topologies
86
+
- Compare ideal conditions vs realistic mainnet-like topologies.
87
87
88
88
Developers continually refine these simulations based on real-world data.
89
89
@@ -93,7 +93,7 @@ Based on preliminary internal testing and simulations:
93
93
94
94
-**Block size:** commonly set to about one-third of the available link capacity for IBs
95
95
-**Voting stages:** choose single-stage or send-recv, depending on reliability and speed requirements
96
-
-**Diffusion strategy:** many operators use 'freshest-first,' though 'peer-order' may help maintain compatibility with older setups
96
+
-**Diffusion strategy:** many operators use 'freshest-first,' though 'peer-order' may help maintain compatibility with older setups.
97
97
98
98
Operators can adjust these parameters, which evolve through community votes.
99
99
@@ -108,19 +108,19 @@ You can follow:
108
108
109
109
These resources provide transparency and regular updates on ongoing development.
110
110
111
-
## What are downstream effects of deploying Leios?
111
+
## What are the downstream effects of deploying Leios?
112
112
113
113
Leios changes how transactions are validated and how blocks and memory pools operate, potentially affecting:
114
114
115
115
-**Wallets and SDKs,** which need to accommodate new block types (IBs and EBs)
116
116
-**Explorers,** which must handle higher throughput and multi-block referencing
117
-
-**Indexers and APIs,** which will see more granular block and vote data
117
+
-**Indexers and APIs,** which will see more granular block and vote data.
118
118
119
-
Weekly progress updates provide deeper analysis of these topics, including how advanced indexing and potential sharding solutions might eventually mitigate challenges.
119
+
Weekly progress updates provide a deeper analysis of these topics, including how advanced indexing and potential sharding solutions might eventually mitigate challenges.
120
120
121
-
## Could the mempool be sized to the throughput of the system?
121
+
## Could the mempool be sized according to the system's throughput?
122
122
123
-
That's already the case. Default mempool size is a small multiple of current block size.
123
+
That's already the case. The default mempool size is a small multiple of the current block size.
Copy file name to clipboardExpand all lines: site/docs/glossary.md
+9-9Lines changed: 9 additions & 9 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -14,30 +14,30 @@ sidebar_position: 5
14
14
15
15
-**Certificate**: A cryptographic proof that attests to the validity of blocks or transactions.
16
16
17
-
-**Decentralization Parameter**: A measure of how distributed the control of the network is among its participants.
17
+
-**Decentralization parameter**: A measure of how distributed the control of the network is among its participants.
18
18
19
19
-**DeltaQ model**: A framework for analyzing and predicting network quality of service (QoS) used to assess delay, loss, and other performance factors.
20
20
21
21
-**Diffusion strategy**: The method used to propagate blocks and votes through the network. Strategies include:
22
22
- Oldest-first strategy – prioritizes older blocks for diffusion
23
23
- Freshest-first strategy – prioritizes newer blocks for diffusion
24
-
- Peer-order strategy – requests blocks in the order they were announced by peers
24
+
- Peer-order strategy – requests blocks in the order they were announced by peers.
25
25
26
-
-**Endorser Block (EB)**: A block that references IBs and is produced by nodes that win the EB sortition lottery.
26
+
-**Endorser block (EB)**: A block that references IBs and is produced by nodes that win the EB sortition lottery.
27
27
28
-
-**Epoch**: A fixed period in the blockchain during which certain processes or calculations are performed.
28
+
-**Epoch**: A fixed period in the blockchain during which specific processes or calculations are performed.
29
29
30
30
-**Equivocation**: The act of producing conflicting blocks or messages in a blockchain network.
31
31
32
32
-**Executable specification**: A formally defined, executable model of a system that ensures an implementation conforms to its intended design.
33
33
34
34
-**Fait accompli sortition**: A cryptographic selection process that ensures fairness and verifiability when choosing validators.
35
35
36
-
-**Freshest First**: A policy for prioritizing newer blocks or transactions over older ones.
36
+
-**Freshest first**: A policy for prioritizing newer blocks or transactions over older ones.
37
37
38
38
-**Haskell simulation**: A parallel simulation of the Leios protocol in Haskell, used for latency measurement, event logging, and parameter tuning.
39
39
40
-
-**Input Block (IB)**: A block that contains transactions and is produced by nodes that win the IB sortition lottery.
40
+
-**Input block (IB)**: A block that contains transactions and is produced by nodes that win the IB sortition lottery.
41
41
42
42
-**Latency**: The delay between the submission of a transaction and its confirmation on the blockchain.
43
43
@@ -63,7 +63,7 @@ sidebar_position: 5
63
63
64
64
-**Quorum**: The minimum number of votes required to certify a block or decision.
65
65
66
-
-**Ranking Block (RB)**: A block that ranks other blocks and is part of the consensus mechanism.
66
+
-**Ranking block (RB)**: A block that ranks other blocks and is part of the consensus mechanism.
67
67
68
68
-**Rational arithmetic**: A method used in Leios sortition to replace quad-precision floating-point calculations, improving precision and computational efficiency.
69
69
@@ -75,9 +75,9 @@ sidebar_position: 5
75
75
76
76
-**Short-Leios simulation**: A version of the Leios simulation that models ranking block intervals and outputs diffusion latency data.
77
77
78
-
-**Sortition**: A probabilistic method for selecting nodes to perform certain roles, based on their stake.
78
+
-**Sortition**: A probabilistic method for selecting nodes to perform specific roles based on their stake.
79
79
80
-
-**Stake**: The amount of cryptocurrency held by a node, which influences its probability of being selected in sortition.
80
+
-**Stake**: The amount of cryptocurrency a node holds, which influences its probability of being selected in sortition.
81
81
82
82
-**Storage cost amortization**: A feature in the cost calculator that spreads storage costs over time, reducing upfront expenses.
0 commit comments