PPoS / Consensus / DA §
Research §
- Nearly completed the PoV v0.2 specifications. Finalizing updates before initiating reviews. This also requires a new PoC for evaluation.
- Updated the PoL v0.2 specifications. Further research is needed to counter adaptive adversaries, a topic previously deferred for future discussion. A PoC will also be required for this.
- Reviewed and refined the finality analysis models. Iterated through several approaches, ultimately formalizing a question for analyzing the GHOST fork choice rule. Previously, the model only supported the longest chain rule.
- Analysis of “safety and liveness” in a variant of the Ouroboros consensus algorithm: considered two approaches to the analysis of the blockchain growth process which uses the GHOST chain selection rule. The first approach is a node-centric approach where we consider the evolution of chains, associated with nodes, in time for each node. These dynamics are non-Markovian, i.e. the chain of node i at time t is a function of all historical chains of all nodes. The latter can be mapped into the tree of blocks. Derived an equation for blockchain growth of a node which uses the most general chain selection rule on all historical chains represented by a tree of blocks. The GHOST algorithm was amended to deal with a scenario when sub-trees have equal weight. The algorithm was made compatible with the node-centric approach and its mathematical description, i.e. in the form of an equation, is still in progress. The second approach that will consider generation of random block trees compatible with the leadership election process and its mathematical description is currently in progress. The details of this work are in the following document (in progress).
Development §
Mixnet §
Research §
- Reviewed the economics module, particularly the construction of the accounting protocol. This module involves significant changes to the Sphinx protocol (essentially its replacement). Resolved many ambiguities, though questions remain regarding the reward-claiming process (potential for collusion) and padding in the design. A protocol sketch undergoing a major revision is available here.
Development §
- PR #897 (Node): Polished packet encoding implementation (simplified Sphinx) as part of Blendnet Tier 1–3 implementation.
- PR #920 (Node): Integrated the cover traffic module into the system as part of Blendnet Tier 1–3.
- PR #919 and PR #923 (Node): Refactored code.
Coordination Layer §
Research §
- Cleaned up the Data Teleportation specification. Identified a vulnerability requiring a fix. Additional research is needed to make the scheme universal and compatible with intents.
- Rewrote the ledger research document to reflect the latest context. Finalization is required to define a structured representation for commitments and nullifiers under the new constraints.
- Created two new specifications for the ledgers: one for the Zone Ledgers, and one for the CL Ledger. The first one needs more research for the commitment of the ledger of the zone (how it will be represented on the CL). The second one has more uncertainty as we need to decide which model is the best to represent the zone states.
- Reviewed and validated the flow diagram for PACTs, including circuit proof generation and verification. Summarized findings and protocol details here.
- Compared Sparse Merkle Trees vs. Indexed Merkle Trees for nullifiers in global state representation. Relevant conclusions will be added to the main document.
- Updated PoC for PACTs and partial transactions, unifying designs. PACTs now represent partial transactions with inputs/outputs from multiple zones. Local partial transactions are treated as single-zone PACTs. PoC work is available in this PR.
Development §
Zone and Apps §
Research §
Development §
Development §
Miscellaneous §
- Published the IPAs article.
- Added the draft for a FRI article in the PCS series, available here.
- Created an unfinished draft titled “Why we chose KZG” as the PCS conclusion.