DAG-based consensus

[s8sato]

Expected benefits:

• 50% less memory usage by eliminating the need for backup mechanisms to handle soft forks.
• 3× faster settlement finality by reducing required network messages from 5*2 to 3.
• Reduced network traffic by eliminating transaction gossiping.
• TPS scalability potentially proportional to the number of validators.

Core idea:

• Instead of gossiping transactions, nodes create and broadcast their own blocks.
• Commits are determined by supporting blocks backward in the graph rather than voting on blocks.

For more details, see Mysticeti, which inspired this approach.
Further research and likely some formal verification are required to ensure the algorithm's reliability before implementation.

References:

• Construct a formal proof that Sumeragi is BFT #1713
• Refactor sumeragi into a state machine #4346