Methods, data structures, and systems for ordered data logging
AssigneenChain Licensing AG
InventorsAndrew James Mee, Ricky Charles Rand, Jack Davies
Life of this patent
Estimating the term…
Abstract
In one aspect, the present disclosure proposes methods, devices, systems, and data structures for implementing an ordered, append-only data logging system. In particular a method comprises creating a transaction of a first type comprising an input associated with a transaction output from a latest transaction in the set of transactions. Then creating a transaction of a second type. Finally submitting both the transaction of the second type and the transaction of the first type to the blockchain.
Claims21
A non-transitory computer readable medium comprising a computer implemented data structure associated with a blockchain, wherein the data structure comprises:
- a first chain of transactions comprising a plurality of transactions including a first blockchain transaction, wherein the plurality of transactions is at an ancestor limit, wherein the first blockchain transaction comprises:
- at least one input associated with an output from a latest transaction in the first chain of transactions, thereby establishing a spending relationship, and
- an output comprising a data payload including a first reference to a second blockchain transaction, wherein the first reference is an invariant reference and/or comprises a transaction id of the second blockchain transaction, and
- a second chain of transactions, comprising:
- a second blockchain transaction, wherein the second blockchain transaction is an initial transaction in the second chain of transactions, and comprises:
- an output comprising a data payload including a second reference to a transaction in the first chain of transactions that is previous to the latest transaction,
- wherein the first blockchain transaction and the second blockchain transaction are not linked by a spending relationship, thereby creating a break in a spending-dependent chain of transactions to overcome an ancestor limit of the blockchain, and
- the first chain of transactions and the second chain of transactions are connected, such that the first reference enables forward traversal through the first and second chains of transactions;
- and the second reference enables backward traversal through the first and second chains of transactions.
A computer implemented method associated with a first chain of transactions in a blockchain system, wherein the first chain of transactions comprises a plurality of transactions including a first blockchain transaction, wherein the plurality of transactions is at an ancestor limit, the method comprising the steps:
- creating a second blockchain transaction to be an initial transaction in a second chain of transactions,
- creating the first blockchain transaction comprising:
- at least one input associated with an output from a latest transaction in the first chain of transactions, thereby establishing a spending relationship, and
- an output comprising a data payload including a first reference to the second blockchain transaction, wherein the first reference is an invariant reference and/or comprises a transaction id of the second blockchain transaction,
- submitting the second blockchain transaction to the blockchain, and
- submitting the first blockchain transaction to the blockchain;
- wherein the second blockchain transaction comprises an output comprising a data payload including a second reference to a transaction in the first chain of transactions that is previous to the latest transaction,
- wherein the first blockchain transaction and the second blockchain transaction are not linked by a spending relationship, thereby creating a break in a spending-dependent chain of transactions to overcome an ancestor limit of the blockchain, and
- the first chain of transactions and the second chain of transactions are connected, such that
- the first reference enables forward traversal through the first and second chains of transactions;
- and the second reference enables backward traversal through the first and second chains of transactions.
A computing device comprising a processor and memory, the memory including executable instructions that, as a result of execution by the processor, causes the computing device to perform a computer-implemented method associated with a first chain of transactions in a blockchain system, wherein the first chain of transactions comprises a plurality of transactions including a first blockchain transaction, wherein the plurality of transactions is at an ancestor limit, the computer-implemented method comprising the steps:
- creating a second blockchain transaction to be an initial transaction in a second chain of transactions,
- creating the first blockchain transaction comprising:
- at least one input associated with an output from a latest transaction in the first chain of transactions, thereby establishing a spending relationship, and
- an output comprising a data payload including a first reference to the second blockchain transaction, wherein the first reference is an invariant reference and/or comprises a transaction id of the second blockchain transaction,
- submitting the second blockchain transaction to the blockchain, and
- submitting the first blockchain transaction to the blockchain,
- wherein the second blockchain transaction comprises an output comprising a data payload including a second reference to a transaction in the first chain of transactions that is previous to the latest transaction,
- wherein the first blockchain transaction and the second blockchain transaction are not linked by a spending relationship, thereby creating a break in a spending-dependent chain of transactions to overcome an ancestor limit of the blockchain, and
- the first chain of transactions and the second chain of transactions are connected, such that
- the first reference enables forward traversal through the first and second chains of transactions;
- and the second reference enables backward traversal through the first and second chains of transactions.
A non-transitory computer-readable storage medium having stored thereon executable instructions that, as a result of being executed by a processor of a computer, cause the computer to perform a method associated with a first chain of transactions in a blockchain system, wherein the first chain of transactions comprises a plurality of transactions including a first blockchain transaction, wherein the plurality of transactions is at an ancestor limit, the method comprising the steps:
- creating a second blockchain transaction to be an initial transaction in a second chain of transactions,
- creating the first blockchain transaction comprising:
- at least one input associated with an output from a latest transaction in the first chain of transactions, thereby establishing a spending relationship, and
- an output comprising a data payload including a first reference to the second blockchain transaction, wherein the first reference is an invariant reference and/or comprises a transaction id of the second blockchain transaction,
- submitting the second blockchain transaction to the blockchain, and
- submitting the first blockchain transaction to the blockchain,
- wherein the second blockchain transaction comprises an output comprising data payload including a second reference to a transaction in the first chain of transactions that is previous to the latest transaction,
- wherein the first blockchain transaction and the second blockchain transaction are not linked by a spending relationship, thereby creating a break in a spending-dependent chain of transactions to overcome an ancestor limit of the blockchain, and
- the first chain of transactions and the second chain of transactions are connected, such that the first reference enables forward traversal through the first and second chains of transactions;
- and the second reference enables backward traversal through the first and second chains of transactions.
Dependencies are inferred from the claim text.