A method for management of financial transactions associated with a funding agreement may include: receiving, at the award information management system and from an awarding organization, details for a funding award comprising an identification of an award recipient, an award amount, and a condition on the use of the award; notifying an award drawdown management system of the award details; identifying a plurality of participating financial institutions to the award recipient; receiving a registration of an account at one of the financial institutions for receiving drawdown funds; communicating an amount of the payment to the fund reporting and analysis system; receiving transaction details from the financial institution having the award recipient's registered account; and providing reports of all transactions in the registered account and any and all optional card accounts with detailed analysis of part transaction, current balances and predictions of future drawdown requests.

A system, method, and computer-readable medium are disclosed for management of a distributed ledger technology customer loyalty program, by establishing a distributed ledger technology network of customer and entity nodes. The entity nodes support products and/or services purchased by customers, providing a distributed ledger technology platform accessible by the nodes. Transactions between nodes go through the distributed ledger technology platform. A distributed ledger technology ledger which tracks the transactions. Coins/credits are provided to customers based on their transactions.

The disclosure relates to, among other things, systems and methods for mitigating the risks of errors, benign or otherwise, occurring within trusted ledgers and/or for validating the integrity of information provided by operators of trusted ledgers. Consistent with embodiments disclosed herein, trusted agents, which may comprise proxy agents and/or test agents, may be employed to examine ledgers and/or derivatives, which may be meshed with other ledgers, to ensure the integrity of information provided by ledger operators. Ledger meshing techniques are described to link ledgers in a manner that improves the ability to verify ledger entries and/or recover from data faults. Further embodiments provide for tagging processes may be performed to give semantic meaning to hashes included in trusted ledgers.

Disclosed are computer-implemented methods, non-transitory computer-readable media, and systems for processing blockchain transactions. An example of a computer-implemented system includes a storage subsystem including one or more storage devices that store blockchain data, and one or more processors configured to support a first thread pool and a second thread pool. The second thread pool is dedicated to the storage subsystem. The system receives M blockchain transactions and executes N blockchain transactions out of the M blockchain transactions in parallel using K threads of the first thread pool. For blockchain transactions distributed to each one of the K threads, one or more coroutines are used for each blockchain transaction so that the blockchain transactions are executed asynchronously using the coroutines. A blockchain block is generated to include the M blockchain transactions and added to a blockchain stored in the storage subsystem.

A digital transaction ledger with a DNA-related parameter is provided by obtaining DNA-based data unique to a particular entity, and establishing a DNA-related ledger parameter using the DNA-based data. Further, the method includes associating the DNA-based ledger parameter with a digital transaction ledger, making the digital transaction ledger related, at least in part, to the obtained DNA-based data.

Methods and systems of operating a blockchain mining device using natural gas produced at a hydrocarbon production, storage, or processing site/facility. A generator may be retrofitted to an existing prime mover used to pump the well, and the generator may be used to power the blockchain mining device. Portable mining devices may be hooked up to a casinghead gas supply at a remote, isolated oil facility. Power loading levels may be modulated by adjusting mining transaction levels to correspond with combustible gas production levels.

In a distributed database, many nodes can store copies, or instances, of the same record. If the record is split on one node, it should be split on the other nodes to maintain consistency, concurrency, and correctness of the data in the distributed database. In some distributed databases, the records are locked during the update process to ensure data integrity. Unfortunately, locking the records can increase latency, especially for larger databases. But if the records aren't locked and a node fails as a record is being split and updated simultaneously, the split and update may not propagate throughout the distributed database, leading to a loss of data integrity. Exchanging messages about the status of record splitting and forwarding updates internally reduces the likelihood of a loss of data integrity due to a node failure.

Efficiently implemented herein is a deterministic semantic for property updates by graph queries. Mechanisms of determinism herein ensure data consistency for graph mutation. These mechanisms facilitate optimistic execution of graph access despite a potential data access conflict. This approach may include various combinations of special activities such as detecting potential conflicts during query compile time, applying query transformations to eliminate those conflicts during code generation where possible, and executing updates in an optimistic way that safely fails if determinism cannot be guaranteed. In an embodiment, a computer receives a request to modify a graph. The request to modify the graph is optimistically executed after preparation and according to safety precautions as presented herein. Based on optimistically executing the request, a data access conflict actually occurs and is automatically detected. Based on the data access conflict, optimistically executing the request is prematurely and automatically halted without finishing executing the request.

Disclosed herein are exemplary systems and methods for garbage collection and/or deletion in a document database. The methods may include, for each change in a first change set, determining whether a first characteristic of the change is superseded by a second characteristic of a corresponding change in a second change set. The change of the first change set and the change of the second change set can pertain to a document attribute. The method may include determining whether the first change set is redundant with the second change set if each change of the first change set is superseded by a corresponding change of the second change set, and eliminating the first change set from the document database when the first change set is redundant with second change set.

A method includes: repeatedly executing a first processing configured to generate, in response to input of conversion examples of values set, a conversion program for converting values of records, convert the values of the records by executing the conversion program, and display a conversion result; and executing a second processing configured to select one or more second records from the records, each of the one or more records being a record on an upper side of a first record, the first record being a record for which a conversion example is added in second or subsequent input, determine whether a value of each second record is changed in a latest conversion result from a previous conversion result, and in response that a value of the second record is changed, cause the first processing to highlight a value of the second record in display of the latest conversion result.