Computation of containment relationships
An example operation may include one or more of generating, by a blockchain node, an asset containment world-state by execution of a linear-time ingestion algorithm, detecting, by the blockchain node, an asset aggregation or disaggregation event, updating, by the blockchain node, the world-state based on the asset aggregation or disaggregation event, and computing supply-chain metrics based on the updated world-state.
1. A node in a blockchain network, the node comprising:
a memory storing one or more instructions; and
a processor that, when executing the one or more instructions, is configured to:
generate an asset containment world-state table that represents latest values for all keys included in a chain transaction log of a blockchain of the blockchain network, wherein rows of the asset containment world-state table correspond to events associated with assets, and wherein each row comprises a start-time field, an end-time field, a start-time-upper-bound field, and an end-time-lower-bound field;
detect that an event associated with an asset occurs at time T 1 , wherein the event comprises an aggregation event or a disaggregation event;
using a smart contract, read key-value pairs stored in the blockchain;
using the smart contract, identify a row in the asset containment world-state table corresponding to a prior event associated with the asset using the key-value pairs that have been read, wherein it is determined that the row needs to be split to create a new row corresponding to the event in response to the event being identified as a child of the prior event based on a start-time-lower-bound field of the row having a value less than or equal to T 1 and an end-time-upper-bound field of the row having a value greater than T 1 , and wherein the prior event is one of the aggregation event or the disaggregation event associated with the asset;
using the smart contract, determine using a linear-time ingestion algorithm that the event occurs in one of an aggregation/disaggregation interval of the prior event, an aggregation/aggregation interval of the prior event, or an aggregation/disaggregation interval of the prior event using the start-time field of the event, the end-time field of the event, the start-time-lower-bound field of the event, and the end-time-upper-bound field of the event;
in response to the determination, using the smart contract to modify the asset containment world-state table to have a new row corresponding to the event by splitting the row corresponding to the prior event into a first row corresponding to the prior event and the new row using the linear-time ingestion algorithm to execute a one-shot ingestion modifying the asset containment world-state table only once, wherein the aggregation/disaggregation event does not modify the asset containment world-state table again even if it is received in an out-of-time order; and
using the smart contract, compute a low-latency, real-time estimation of supply-chain metrics based on the modified updated world-state table using a smart contract of the blockchain.
2. The node of claim 1 , wherein the processor is further configured to:
detect the aggregation event or the disaggregation event at an asset ingestion time.
3. The node of claim 1 , wherein the processor is further configured to:
split the computation of the supply-chain metrics between an ingestion time and a query time.
4. The node of claim 1 , wherein the processor is further configured to:
execute the linear-time algorithm to process combinations of asset aggregation or disaggregation orderings at a query time.
5. The node of claim 4 , wherein the processor is further configured to:
unroll multiple levels of an asset containment based on children.
6. The node of claim 5 , wherein the processor is further configured to:
detect parent-child-parent loop errors.
7. A method, comprising:
generating an asset containment world-state table by a blockchain node, wherein the asset containment world-state table represents latest values for all keys included in a chain transaction log of a blockchain of the blockchain network, wherein rows of the asset containment world-state table correspond to events associated with assets, and wherein each row comprises a start-time field, an end-time field, a start-time-upper-bound field, and an end-time-lower-bound field;
by the blockchain node, detecting that an event associated with an asset occurs at time T 1 , wherein the event comprises an aggregation event or a disaggregation event;
by the blockchain node, read key-value pairs stored in the blockchain using a smart contract;
by the blockchain node executing the smart contract, identifying a row in the asset containment world-state table that corresponding to a prior event associated with the asset using the key-value pairs that have been read, wherein it is determined that the row needs to be split to create a new row corresponding to the event in response to the event being identified as a child of the prior event based on a start-time-lower-bound field of the row having a value less than or equal to T 1 and an end-time-upper-bound field of the row having a value greater than T 1 , and wherein the prior event is one of the aggregation event or the disaggregation event associated with the asset;
by the blockchain node executing the smart contract, determining using a linear-time ingestion algorithm that the event occurs in one of an aggregation/disaggregation interval of the prior event, an aggregation/aggregation interval of the prior event, or an aggregation/disaggregation interval of the prior event using the start-time field of the event, the end-time field of the event, the start-time-lower-bound field of the event, and the end-time-upper-bound field of the event;
by the blockchain node executing the smart contract and in response to the determining, modifying the asset containment world-state table to have a new row corresponding to the event by splitting the row corresponding to the prior event into a first row corresponding to the prior event and the new row using the linear-time ingestion algorithm to execute a one-shot ingestion modifying the asset containment world-state table only once, wherein the aggregation/disaggregation event does not modify the asset containment world-state table again even if it is received in an out-of-time order; and
by the blockchain node executing the smart contract, computing a low-latency, real-time estimation of supply-chain metrics based on the modified world-state table using a smart contract of the blockchain.
8. The method of claim 7 , further comprising:
detecting the aggregation event or the disaggregation event at an asset ingestion time.
9. The method of claim 7 , further comprising:
splitting the computation of the supply-chain metrics between an ingestion time and a query time.
10. The method of claim 7 , further comprising:
executing the linear-time algorithm to process combinations of asset aggregation or disaggregation orderings at a query time.
11. The method of claim 10 , further comprising:
unrolling multiple levels of an asset containment based on children.
12. The method of claim 11 , further comprising:
detecting parent-child-parent loop errors.
13. A non-transitory computer-readable medium comprising one or more instructions that, when executed by a processor of a node in a blockchain network, cause the processor to perform:
generating an asset containment world-state table by a blockchain node, wherein the asset containment world-state table represents latest values for all keys included in a chain transaction log of a blockchain of the blockchain network, wherein rows of the asset containment world-state table correspond to events associated with assets, and wherein each row comprises a start-time field, an end-time field, a start-time-upper-bound field, and an end-time-lower-bound field;
by the blockchain node, detecting that an event associated with an asset occurs at time T 1 , wherein the event comprises an aggregation event or a disaggregation event;
by the blockchain node, read key-value pairs stored in the blockchain using a smart contract;
by the blockchain node executing the smart contract, identifying a row in the asset containment world-state table that corresponding to a prior event associated with the asset using the key-value pairs that have been read, wherein it is determined that the row needs to be split to create a new row corresponding to the event in response to the event being identified as a child of the prior event based on a start-time-lower-bound field of the row having a value less than or equal to T 1 and an end-time-upper-bound field of the row having a value greater than T 1 , and wherein the prior event is one of the aggregation event or the disaggregation event associated with the asset;
by the blockchain node executing the smart contract, determining using a linear-time ingestion algorithm that the event occurs in one of an aggregation/disaggregation interval of the prior event, an aggregation/aggregation interval of the prior event, or an aggregation/disaggregation interval of the prior event using the start-time field of the event, the end-time field of the event, the start-time-lower-bound field of the event, and the end-time-upper-bound field of the event;
by the blockchain node executing the smart contract and in response to the determining, modifying the asset containment world-state table to have a new row corresponding to the event by splitting the row corresponding to the prior event into a first row corresponding to the prior event and the new row using the linear-time ingestion algorithm to execute a one-shot ingestion modifying the asset containment world-state table only once, wherein the aggregation/disaggregation event does not modify the asset containment world-state table again even if it is received in an out-of-time order; and
by the blockchain node executing the smart contract, computing a low-latency, real-time estimation of supply-chain metrics based on the modified world-state table using a smart contract of the blockchain.
14. The non-transitory computer-readable medium of claim 13 , wherein the one or more instructions further cause the processor to perform:
detecting the aggregation event or the disaggregation event at an asset ingestion time.
15. The non-transitory computer-readable medium of claim 13 , wherein the one or more instructions further cause the processor to perform:
splitting the computation of the supply-chain metrics between an ingestion time and a query time.
16. The non-transitory computer-readable medium of claim 13 , wherein the one or more instructions further cause the processor to perform:
executing the linear-time algorithm to process combinations of asset aggregation or disaggregation orderings at a query time.
17. The non-transitory computer-readable medium of claim 16 , wherein the one or more instructions further cause the processor to perform:
unrolling multiple levels of an asset containment based on children and detecting parent-child-parent loop errors.