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: docs/workshop/day-3-recap.md
+9-8Lines changed: 9 additions & 8 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -36,6 +36,7 @@ Each of the following approaches describes a solution where an Input Block (IB)
36
36
#### IB-to-RB Reference Approach
37
37
38
38
The simplified diagram below shows respective lower and upper bounds for selecting an RB as ledger state reference for IB validation - each showing the extreme ends of trading off latency for security. Realistically, both are not good choices and some RB such as tip-3 might be more suitable. Note, that even the tip-3 example would introduce on average a delay of 3×20s = 60s before a user could reference outputs from a previously submitted transaction.
39
+
The figure below illustrates how one can select different degrees of latency using this IB-to-RB reference approach.
39
40
40
41

41
42
@@ -48,17 +49,17 @@ Thus, we can define a new parameter to define stability for Leios which ranges b
48
49
49
50

50
51
51
-
This diagram shows the same ledger reference approach - pointing to RBs, but also includes EBs which have been hidden in the previous example for the stake of simplicity.
52
+
This diagram shows the same ledger reference approach - IBs pointing to RBs, but also includes EBs which have been hidden in the previous example for the stake of simplicity. As a reminder EBs store IBs by reference.
52
53
53
54
##### 2. Different IB-to-RB references
54
55
55
56

56
57
57
-
The above diagram displays a more realistic picture of different IBs referencing different RBs as their ledger state reference for validation.
58
+
The above diagram displays a more realistic picture of IBs referencing different RBs as their ledger state reference for validation.
58
59
59
60
#### EB Reference Approach
60
61
61
-
The EB reference approach offers a middle ground between security and latency. Certified EBs (those that have received votes from a majority of stake) provide security guarantees with lower latency than the [RB-reference approach](#rb-reference-approach), as they indicate that enough nodes have seen and validated them. Several core variations of the EB reference approach were discussed:
62
+
In the following context, when we refer to EBs, we implicitely mean certified EBs that have received votes from a majority of stake. The EB reference approach offers a middle ground between security and latency. Certified EBs provide security guarantees with lower latency than the [RB-reference approach](#rb-reference-approach), as they indicate that enough nodes have seen and validated them. Several variations of the EB reference approach were discussed:
62
63
63
64
##### 1. **EB Reference**
64
65
@@ -71,26 +72,26 @@ Different to the [IB-to-RB referencing](#ib-to-rb-reference-approach), this appr
71
72
We briefly discussed an alternative design choice, in which IBs reference an EB and an RB. However, that design would result in many ledger states that would need to be computed and was therefore dismissed as too expensive.
72
73
73
74
In this design, one gets a ledger state for each RB which gives a ledger state for each EB to be reused and IBs are validated with respect to that same state. On the contrary, due to EBs referencing an RB, there is still the same trade-off to be made as in the [IB-to-RB reference approach](#ib-to-rb-reference-approach) - having to chose more or less stable RBs for EBs resulting in higher latency or higher loss in EBs.
74
-
75
+
This scheme also doesn't handle edge cases well, such as two EBs being produced in parallel or within the same pipeline unless we include multiple EB certificates in RBs.
75
76
76
77
##### 2. **EB-Chain**
77
78
78
-
In this approach IBs reference an EB which itself may reference another EB, which creates this chain of EBs that anchors on some older RB reference. Thus, EBs may have an RB reference or another EB reference of an EB that has not made it into an RB yet (full Leios variant). RBs on the other hand can only exactly reference one certified EB. IBs reference one of these EBs.
79
+
In this approach IBs reference an EB which itself may reference another EB, which creates this chain of EBs that anchors on some older RB reference. Thus, EBs may have an RB reference or another EB reference of an EB that has not made it into an RB yet (full Leios variant). RBs on the other hand can only exactly reference one certified EB. IBs reference one of these EBs. This solves for multiple EBs having been produced concurrently because one can be incoporated into an RB and the other temporarily orphaned one can be referenced by a new EB constructing a chain of EBs.
79
80
80
-
As a downside of this approach, it doesn't allow for EBs to reference one or more EBs. Therefore, it still has the same trade-off from the previous [IB-to-EB-to-RB](#1-ib-to-eb-to-rb-reference) approach, since these chains of EBs are anchored to RBs, which comes with this disadvantageous property of high latency, older stable RBs vs low latency, less stable RBs.
81
+
This scheme still has the same trade-off from the previous [IB-to-EB-to-RB](#1-ib-to-eb-to-rb-reference) approach, since these chains of EBs are anchored to RBs, which comes with this disadvantageous property of high latency, older stable RBs vs low latency, less stable RBs.
81
82
82
83

83
84
84
85
##### 3. **EB-DAG**
85
86
86
87
The EB DAG approach represents a sophisticated approach that leverages a directed acyclic graph (DAG) structure of Endorsement Blocks (EBs) to achieve both low latency and strong security guarantees. In this design:
87
88
88
-

89
-
90
89
- EBs can reference one or more older EBs that haven't been referenced by other EBs yet
91
90
- Ranking Blocks (RBs) reference exactly one EB
92
91
- Input Blocks (IBs) reference one of these EBs
93
92
93
+

94
+
94
95
**Key Advantages:**
95
96
96
97
1.**Low Latency with Security**: By allowing EBs to reference other EBs directly, the system achieves low latency while maintaining security. This is because EBs don't need to wait for RBs to be produced, creating a more efficient validation pipeline.
0 commit comments