Finite State Machine Distributed Ledger Node Startup
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Distributed ledgers face challenges in managing large transaction records and ensuring secure user access, as adding new nodes requires reading through extensive records and sensitive information may be inaccessible to unauthorized users, complicating access management.
Innovation Solution
Implementing a distributed ledger system with finite state machine records and intrinsic bi-temporal primitives, enabling point-in-time node restarts, efficient information lifecycle management, and secure user access through data access keys, along with immediate failover from primary to secondary order books.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a new node is added to the distributed ledger, then the node can access and validate transactions, but the node must read through the entire record of transactions which takes a large amount of time and requires large storage capacity
Solution Approach 1:
The patent pre-calculates and stores the current state of all domain objects in the ledger before a new node joins. This preliminary action allows the new node to immediately access the current state without having to read through the entire transaction history, thereby reducing startup time while maintaining validation capability
Solution Approach 2:
The patent extracts only the essential current state information from the complete transaction record and presents it to new nodes. Instead of requiring new nodes to process the entire transaction history, the system extracts and provides just the necessary state data, reducing both time and storage requirements
2Reliability
If sensitive information is stored in the distributed ledger, then transaction data is preserved, but access management becomes difficult as information should only be accessible to particular users
Solution Approach 1:
The patent implements fine-grained access control where different users have different levels of access to different portions of the ledger data. Each user account is associated with specific domain objects and events that they are authorized to access, creating local quality in access permissions rather than uniform access control
Solution Approach 2:
The patent introduces an intermediary access control mechanism that mediates between users and the ledger data. The system uses user accounts, domain objects, and events as intermediaries to manage access, where the ledger structure itself serves as the intermediary that enforces access rules without requiring external access management systems
3Stability of the object's composition
If the complete transaction record is maintained for all nodes, then data consistency is ensured, but storage requirements become prohibitively large
Solution Approach 1:
The patent extracts only the essential state information needed for data consistency from the complete transaction record. Each node stores the current state of domain objects rather than the entire transaction history, maintaining consistency while reducing storage requirements
Solution Approach 2:
The patent creates simplified copies of the transaction data in the form of state snapshots that can be distributed to nodes. These copies contain only the necessary state information rather than the complete transaction record, allowing nodes to maintain consistency through state synchronization rather than full transaction history replication
Data Source
AI summary
A distributed ledger is stored by a plurality of node computing entities. A node computing entity of the plurality of node computing entities comprises at least one processor, a memory, and a communications interface configured to communicate via at least one network. The node computing entity creates a finite state machine record set. A finite state machine record of the finite state machine record set comprises (a) event data for a corresponding event and (b) a domain object state for a domain object corresponding to the corresponding event. The domain object state indicating the state of the domain object as a result of the corresponding event. The node computing entity generates a block comprising the finite state machine record set and posts the block to the distributed ledger.