US2022318270A1PendingUtilityA1
Artificial intelligence (ai)-based blockchain management
Est. expiryMar 30, 2041(~14.7 yrs left)· nominal 20-yr term from priority
G06N 3/08G06N 3/04G06N 20/00G06F 16/2379G06F 16/28G06F 16/22
50
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
Aspects of this disclosure relate to artificial intelligence (AI)-assisted creation of a blockchain by a decentralized network. Various aspects of this disclosure relate to AI-based determination of blockchain parameters for use in workflow management processes. However, the AI-based approaches described herein are applicable for any blockchain-based procedures. Blockchain parameters, such as a block size, may be determined based on one or more parameters associated with the decentralized network (e.g., input/output load, network bandwidth, etc.).
Claims
exact text as granted — not AI-modified1 . A method for dynamic new block creation in a blockchain, the method comprising:
receiving, at a workflow engine and from a user computing device comprising a graphical user interface module, a first worklist item; validating, at the workflow engine, the first worklist item; adding the first worklist item to a data store communicatively coupled with a plurality of user computing devices, wherein the data store comprises a plurality of worklist items including the first worklist item; comparing, by a computer processor, a size of the plurality of worklist items to a threshold size, wherein the threshold size is dynamic; determining, by the computer processor, that the size meets the threshold size; in response to the determining that the size meets the threshold size, generating a hash value corresponding to the plurality of worklist items in the data store; creating a new block using the generated hash value and an immediately preceding block hash in the blockchain; transmitting the new block for addition to the blockchain; and updating the workflow engine with the blockchain, wherein the workflow engine comprises activity names and identifiers corresponding to the plurality of worklist items.
2 . The method of claim 1 , wherein the threshold size is dynamic by:
monitoring an input and output (I/O) load of the data store; monitoring a network bandwidth corresponding to the data store; and increasing the threshold size when the I/O load is high and the network bandwidth is high.
3 . The method of claim 2 , wherein a high network bandwidth comprises values in an upper quartile of a range of network bandwidths over a historical time period.
4 . The method of claim 2 , wherein a high I/O load comprises values in a higher quartile of a range of I/O loads over a historical time period.
5 . The method of claim 2 , wherein the monitoring the I/O load of the data store comprises monitoring at least one of:
an average size of the data store; an arrival rate of worklist items to the data store; an average wait time for a worklist item in the data store; and combinations thereof.
6 . The method of claim 2 , wherein the monitoring the network bandwidth of the data store comprises monitoring at least one of:
an average data transfer rate to the data store; an average packet transfer rate to the data store; and combination thereof.
7 . The method of claim 1 , wherein the threshold size is dynamic by:
monitoring an input and output (I/O) load of the data store; increasing the threshold size when the I/O load is high.
8 . The method of claim 5 , further comprising decreasing the threshold size when the I/O load is low, wherein a low I/O load comprises values in a lower quartile of a range of I/O loads over a historical time period.
9 . The method of claim 1 , wherein the threshold size is dynamic by:
monitoring a network bandwidth corresponding to the data store; and decreasing the threshold size when the network bandwidth is low.
10 . The method of claim 9 , further comprising decreasing the threshold size when the network bandwidth is low, wherein a low network bandwidth comprises values in a lower quartile of a range of network bandwidths over a historical time period.
11 . The method of claim 1 , further comprising allocating an award to a first blockchain node, of a plurality of blockchain nodes associated with the plurality of user computing devices, in response to adding of the new block to the blockchain.
12 . The method of claim 1 , wherein the creating the new block comprises adding a time stamp to the block, wherein the time stamp indicates a time of creation of the new block.
13 . The method of claim 1 , wherein the first worklist item comprises:
an indication of the user computing device; and one or more worklist tasks associated with a workflow.
14 . The method of claim 1 , wherein the first worklist item comprises updated information associated with a worklist task stored in a previous block of the blockchain.
15 . The method of claim 1 , wherein the validating the first worklist item comprises determining whether the user computing device is authorized to send the first worklist item.
16 . A system comprising:
a user computing device comprising a graphical user interface (GUI) module configured to receive an input indicating first worklist item; an ordering service server communicatively coupled to a plurality of user computing devices including the user computing device, wherein the ordering service server is configured to:
receive, from the user computing device, the first worklist item; and
add the first worklist item to a data store, wherein the data store comprises a plurality of worklist items including the first worklist item;
a computer processor configured to:
compare a size of the plurality of worklist items to a threshold size, wherein the threshold size is dynamic;
determine that the size meets the threshold size;
in response to the determining that the size meets the threshold size, generate a hash value corresponding to the plurality of worklist items in the data store;
create a new block using the generated hash value and an immediately preceding block hash in a blockchain; and
transmit the new block for addition to the blockchain; and
a workflow engine configured to:
receive, from the ordering service server, the first worklist item;
validate the first worklist item; and
update, based on the new block, worklists associated with the plurality of user computing devices.
17 . The system of claim 16 , wherein the threshold size is dynamic by:
monitoring an input and output (I/O) load of the data store; monitoring a network bandwidth corresponding to the data store; and increasing the threshold size when the I/O load is high and the network bandwidth is high.
18 . The system of claim 17 , wherein a high network bandwidth comprises values in an upper quartile of a range of network bandwidths over a historical time period.
19 . The system of claim 17 , wherein a high I/O load comprises values in a higher quartile of a range of I/O loads over a historical time period.
20 . A non-transitory computer-readable medium storing computer-executable instructions that, when executed by one or more computer processors, cause a blockchain computer system to:
receive, from a user computing device comprising a graphical user interface module, a first worklist item; validate the first worklist item; add the first worklist item to a data store communicatively coupled with a plurality of user computing devices, wherein the data store comprises a plurality of worklist items including the first worklist item; compare a size of the plurality of worklist items to a threshold size, wherein the threshold size is dynamic; determine that the size meets the threshold size; in response to the determining that the size meets the threshold size, generate a hash value corresponding to the plurality of worklist items in the data store; create a new block using the generated hash value and an immediately preceding block hash in a blockchain; and transmit the new block for addition to the blockchain.Join the waitlist — get patent alerts
Track US2022318270A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.