Blockchain Cyclic Node Sets for Distributed Processing Order
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Distributed computing systems face challenges in enforcing ordered processing steps across nodes and subcomponents, particularly in ensuring tamper-proof audit trails for tasks like aircraft pre-flight checks, where failures need to be attributed to specific subsystems for root-cause determination.
Innovation Solution
A method using a blockchain network with cyclically-ordered sets of nodes, where a private key is generated and shared cryptographically among nodes, allowing transactions to control resource transfer based on locking and unlocking values, enabling ordered processing and optional skipping of subsystems or subcomponents, and providing a tamper-resistant audit trail.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If distributed processing is implemented across multiple nodes, then system reliability and fault tolerance are improved, but coordination complexity and difficulty of enforcing processing order increase
Solution Approach 1:
The system segments the distributed network into cyclically-ordered sets of nodes, where each set handles specific processing steps in a defined sequence. This segmentation allows independent coordination within each cycle while maintaining overall system reliability through the distributed architecture.
Solution Approach 2:
The system establishes processing order and coordination rules in advance through the cyclically-ordered structure before actual processing occurs. Nodes know their position and next steps beforehand, eliminating the need for complex real-time coordination during execution.
2Measurement precision
If tamper-proof audit trails are implemented using blockchain, then forensic investigation capability and failure attribution are improved, but system complexity and computational overhead increase
Solution Approach 1:
The blockchain acts as an intermediary layer that records processing steps and outcomes without requiring changes to the core processing logic. This mediator provides tamper-proof audit trails while keeping the main system architecture relatively simple and modular.
Solution Approach 2:
The system creates cryptographic copies of processing records on the blockchain that serve as immutable audit trails. These copies preserve the original processing information while providing forensic capability, separating the auditing function from the primary processing function.
3Manufacturing precision
If strict processing order is enforced across all nodes, then processing accuracy and correctness are improved, but system flexibility and ability to skip subsystems deteriorate
Solution Approach 1:
The cyclically-ordered structure allows the processing sequence to be dynamic rather than fixed. Nodes can be added, removed, or skipped based on system conditions while maintaining the cyclic nature of processing, enabling both accuracy through ordering and flexibility through adaptability.
Solution Approach 2:
The cyclically-ordered set structure serves multiple functions: it enforces processing order when needed, allows skipping of failed or optional subsystems, and provides a framework for both strict and flexible processing scenarios within the same architectural pattern.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method of controlling and coordinating of processing steps in a distributed system can be implemented by an initiator node of a cyclically-ordered set of nodes participating in a blockchain network (e.g., Bitcoin blockchain). The method includes generating a private key and cryptographic shares thereof for the nodes of the set and distributing them. A locking value is determined based on the shares and a transaction is arranged to transmit control of a resource responsive to supply of a corresponding unlocking value. A circuit of transactions amongst the nodes each arranged to transmit control of a resource responsive to supply of an unlocking value corresponding to a locking value determined based on the share distributed to a first node of one of two adjacent nodes and a value received from another node immediately previous to it is prepared. The initiator node may belong to a cyclically-ordered set of initiator nodes.