Replicated State Machine Transitions via MVCC and DAG Consensus

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing state machine replication methods struggle with non-deterministic concurrent executions and network latency, leading to inconsistencies and inefficiencies in distributed networks, particularly in blockchain and distributed database systems.

Innovation Solution

A system architecture utilizing Multi-Version Concurrency Control (MVCC) databases and Directed Acyclic Graph (DAG) based consensus protocols to enable non-deterministic concurrent executions, allowing transactions to be executed, validated, and merged without the need for sequential ordering, and incorporating conflict resolution mechanisms to ensure consistency across nodes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If transactions are executed sequentially to ensure consistency, then reliability is improved, but productivity deteriorates

Engineering Contradiction:

ImproveconsistencyVSAvoidthroughput

Core Design Contradiction:

ReliabilityVSProductivity

Solution Approach 1:

The patent segments transactions into different execution groups that can be processed concurrently. By dividing the transaction processing into multiple independent execution paths with proper synchronization, the system achieves both parallel processing (improving throughput) and consistent state transitions (maintaining reliability).

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent implements dynamic transaction ordering where the execution sequence is determined based on dependencies and conflicts detected at runtime rather than fixed beforehand. This dynamic approach allows flexible concurrent execution while maintaining consistency through conflict resolution mechanisms.

Inventive Principle:

Principle #15Dynamics

2Device complexity

If transactions are ordered before execution to simplify consensus, then device complexity is reduced, but loss of time increases

Engineering Contradiction:

Improveconsensus protocol complexityVSAvoidtransaction processing time

Core Design Contradiction:

Device complexityVSLoss of time

Solution Approach 1:

The patent performs preliminary conflict detection and dependency analysis before full execution, allowing transactions to be prepared and validated in advance. This preliminary action identifies potential conflicts early, enabling efficient resolution without requiring complex post-execution ordering mechanisms.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent creates copies of transaction execution contexts for parallel processing. Multiple nodes can execute transaction copies concurrently, and conflict resolution is applied to reconcile results, eliminating the need for strict sequential ordering while maintaining consistency.

Inventive Principle:

Principle #26Copying

3Reliability

If replay messages include full execution results to enable deterministic replay, then reliability is improved, but loss of substance increases

Engineering Contradiction:

Improvedeterministic replay capabilityVSAvoidnetwork bandwidth consumption

Core Design Contradiction:

ReliabilityVSLoss of substance

Solution Approach 1:

The patent extracts only the essential replay information needed for deterministic execution, separating critical state transition data from redundant execution details. By transmitting only the minimal necessary information (extracted replay logs), the system enables reliable replay while minimizing network bandwidth consumption.

Inventive Principle:

Principle #2Taking out (Extraction)

Solution Approach 2:

Instead of including full execution results in replay messages, the patent inverts the approach by having nodes independently reconstruct execution results from compact replay logs and local state. This reduces message size while maintaining replay determinism through inverse reconstruction logic.

Inventive Principle:

Principle #13The other way round (Inversion)

Data Source

PatentUS20250307264A1Methods and systems for replicated state machine transition

Publication Date: 2025.10.02 CONCURSYS INC

AI summary

The present disclosure presents methods and architectures that allow non-deterministic concurrent executions that can potentially interleave with other executions and replays in a SMR system. The current disclosure further discloses architectures and methods that executes, validates (replay) then merges transactions without the need to first order the transactions therefore achieves higher throughput. Another aspect of the invention involves organizing SM state as a Multi-Version Concurrency Control (MVCC) database with all concurrent execution/replay generating operation logs on each resource. This disclosure additionally outlines methods for integrating client nodes with State Machine Replication (SMR) systems. This disclosure further provides improved Directed Acyclic Graph (DAG) based consensus protocols.