Time-sequenced Asynchronous Byzantine Fault Tolerant Consensus
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current distributed ledger technologies face challenges in providing highly secure and scalable transactions while maintaining key features like immutability, decentralization, consensus, security, and automation, particularly in preserving the time order and first-in, first-out position of transactions across all nodes in a network.
Innovation Solution
A time-sequenced, asynchronous Byzantine Fault Tolerant consensus system that uses timestamps and cryptographic hashes, combined with quantum-safe encryption and ultra-reliable communication protocols, ensures secure and rapid transfer of transactions among distributed ledger nodes, eliminating the need for traditional block-based processing and minimizing latency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If block mining is used to process transactions in batches, then security and immutability are improved, but transaction speed and throughput deteriorate
Solution Approach 1:
The patent divides the transaction processing system into distinct components: object routers that receive and timestamp transactions, validator nodes that verify transactions independently, and a consensus mechanism that coordinates them. This segmentation allows parallel processing of transactions while maintaining security through distributed validation, eliminating the bottleneck of sequential block mining.
Solution Approach 2:
The patent implements preliminary timestamping of transactions as they enter the network, creating a time-ordered sequence before validation occurs. This preliminary action establishes the chronological order of transactions independently of the validation process, allowing transactions to be processed and validated in parallel while preserving their original sequence, thus increasing throughput without compromising integrity.
2Adaptability or versatility
If proof-of-work block processing is used, then decentralized consensus is achieved, but transaction speed deteriorates
Solution Approach 1:
The patent transitions from the static, periodic nature of block-based processing to a dynamic, continuous transaction validation model. Validator nodes continuously receive and validate transactions in real-time as they arrive, rather than waiting for batch processing intervals. This dynamic approach maintains decentralized consensus while dramatically increasing transaction speed by eliminating the waiting period between blocks.
Solution Approach 2:
The patent establishes continuous transaction validation where validator nodes operate without interruption, constantly receiving, verifying, and consensus-ing on transactions as they flow through the network. This continuous operation replaces the intermittent, periodic validation of block mining, maintaining security through ongoing decentralized verification while achieving sustained high-speed processing throughout the system.
3Ease of manufacture
If traditional block-based processing is used, then transaction grouping is simplified, but latency increases
Solution Approach 1:
The patent applies preliminary timestamping to transactions immediately upon their entry into the network, creating a time-ordered sequence before any validation or grouping occurs. This preliminary action eliminates the need for complex post-reception grouping operations, as transactions are already sequenced by timestamp. The result is both simplified processing and reduced latency, as transactions begin their validation journey in the correct order without requiring batch assembly delays.
Data Source
AI summary
A system for processing distributed ledger transactions using a time-sequenced, asynchronous, Byzantine Fault Tolerant (taBFT) consensus system. Transaction data from a client device is received by a full node in a distributed ledger network. The full nodes are preferably satellite based nodes. The full nodes include an object router and a validator node. Transaction data is received at the object router, a timestamp is attached to the transaction data, and the combined data is encrypted and sent to the validator node, and also to other full nodes. The validator node verifies the format, structure and correctness of the data contained in the transaction, and validates the requested transaction. Other full nodes receive the encrypted transaction data and make their own determination of the validity of the transaction data. Upon consensus approval of a transaction, the transaction data is executed and submitted to a permanent data store.