<aside> 👀 Verification Node Roadmap (towards an autonomously-operating network)

</aside>

This page contains high-level recommendations for the Verification Nodes’ software design. The review from Krok should evaluate:

• To which extend the current design already follows these recommendations.
• If the current design co~nflicts with the recommendations, how complicated is it to adjust the design to follow the recommendations?
• What is the cost of not following the recommendation?

Terminology

• finalize seal for block B: means that a finalized block X exists that holds a seal for an execution result for block B

Recommendations

Implement an information driven system

information driven system = event driven system + convention that all events are idempotent

Speculative Verification hopefully adds not much complexity

• LevelledForest (code) provides a good framework for fork-aware data structures

  ExecutionTree (Readme, implementation) and AssignmentCollectorTree (Readme, implementation) are examples that use the LevelledForest to implement stateful, fork-aware mempools.

• Particularly the AssignmentCollectorTree demonstrates how implement

  • tracking forks
  • update the state of individual elements in a concurrent non-blocking manner
  • prune by view (see pruning implementation here and logic triggering the pruning)
  • orphan upon observing a finalized seal

Tree of incorporated results