Asynchronous Continuation for Low-Latency Decentralized Workflows

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current decentralized systems face scalability limitations, inefficiencies in bandwidth and scale, and lack of secure interoperability, making them unsuitable for high-bandwidth and latency-critical applications, while also requiring substantial computing resources and energy.

Innovation Solution

A method for processing instructions in a decentralized system involving a plurality of independent node-sets, with a leading validation cluster performing a fast track execution process and generating a proposed order, followed by a consensus process among follower validation clusters to ensure duplicate execution of instructions, utilizing a Directed Acyclic Graph (DAG) and Merkle trees for data management.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If decentralized systems use traditional consensus mechanisms, then security and fault tolerance are improved, but processing speed and scalability deteriorate

Engineering Contradiction:
Improvefault toleranceVSAvoidprocessing speed
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The system segments the validation process into distinct phases: a fast track execution phase that processes instructions quickly with limited validation, and a consensus phase that ensures fault tolerance. This segmentation allows the system to achieve both high processing speed and reliability by performing different functions at different stages rather than requiring full consensus for every operation.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system performs preliminary execution of instructions in the fast track phase before final consensus validation. By executing instructions preliminarily and then validating them through consensus, the system achieves high throughput while maintaining security. The preliminary action allows most operations to complete quickly, with consensus serving as a post-validation safeguard.

Inventive Principle:
Principle #10Preliminary action

2Productivity

If decentralized systems process high-volume transactions, then throughput is improved, but latency increases

Engineering Contradiction:
ImprovethroughputVSAvoidlatency
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The validation process is segmented into fast track execution and consensus validation phases. The fast track phase processes instructions with minimal latency, while the consensus phase operates in parallel or subsequently, allowing high throughput without penalizing individual transaction latency.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system maintains continuous processing through the fast track execution mechanism, which continuously validates and processes instructions without interruption. Meanwhile, consensus validation operates continuously in the background, ensuring that high throughput is maintained while security requirements are met without adding significant latency.

Inventive Principle:
Principle #20Continuity of useful action

3Reliability

If decentralized systems implement comprehensive validation, then security is improved, but computational overhead increases

Engineering Contradiction:
ImprovesecurityVSAvoidcomputational overhead
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

Validation is segmented into lightweight fast track validation and comprehensive consensus validation. The fast track phase performs essential security checks with minimal computational overhead, while the consensus phase performs comprehensive validation only when necessary, reducing overall energy consumption while maintaining security.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The system uses cryptographic hashes and Merkle trees to create compact representations of validation states. Instead of validating entire transaction histories, nodes validate cryptographic proofs and hashes, dramatically reducing computational overhead while maintaining comprehensive security validation.

Inventive Principle:
Principle #26Copying

4Stability of the object's composition

If decentralized systems maintain consistency across nodes, then data integrity is improved, but scalability deteriorates

Engineering Contradiction:
Improvedata integrityVSAvoidscalability
Core Design Contradiction:
Stability of the object's compositionVSProductivity

Solution Approach 1:

The system uses cryptographic hashing and Merkle trees to create compact, verifiable copies of data integrity proofs. Nodes can validate data integrity by checking these cryptographic proofs rather than maintaining full copies of all data, enabling scalability while preserving data integrity across the distributed network.

Inventive Principle:
Principle #26Copying

Solution Approach 2:

The system performs preliminary data processing and validation in the fast track phase, creating preliminary valid states that are later confirmed through consensus. This preliminary action establishes data integrity early, allowing the system to scale by processing more transactions through the fast track while maintaining integrity through subsequent consensus confirmation.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS20260067094A1Asynchronous continuation mechanism for chained instructions in resilient decentralized systems
Publication Date: 2026.03.05 GOBARU LTD
  • US20260067094A1 patent drawing
  • US20260067094A1 patent drawing
  • US20260067094A1 patent drawing

AI summary

A method and system for executing chained instructions in a resilient, decentralized architecture are disclosed. The system enables complex workflows through an asynchronous continuation mechanism. An initial instruction, executed by a first entity in a leading validation cluster, can generate one or more continuation instructions directed to other entities. These continuations are executed immediately on a “fast track” path within the leading cluster, creating a high-speed, non-blocking sequence of cross-entity actions prior to network-wide consensus. The resulting ordered sequence is then proposed to follower clusters, which perform a consensus before executing a duplicate, verifiable instance of the entire instruction chain. This separation of optimistic, continuation-driven execution from deliberate, consensus-based finality facilitates a pipelined and parallel processing model. The architecture provides the foundation for resilient microservice applications requiring complex, low-latency, and asynchronous interactions across a scalable, decentralized system.