# US 2021/0081402 A1 · Creating blocks in instance blockchain base on a promised block in a generic blockchain > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2021/0081402 A1 - Document ID: US20210081402A1 - Status: Published application - Kind: A1 - Application number: 16/574,553 - Filed: 2019-09-18 - Published: 2021-03-18 - Earliest claimed: 2019-09-18 - Assignees: Boardwalktech, Inc. - Applicants: Boardwalktech, Inc. - Inventors: Ganesh Krishnan; Dharmesh Dadbhawala; Ashish Baluja; Bhaumik Dedhia - Web page: https://patentgrep.com/patent/US20210081402A1 ## CPC - G06F 16/2379: {Updates performed during online database operations; commit processing} - G06F 21/64: Protecting data integrity, e.g. using checksums, certificates or signatures - G06F 16/1805: {Append-only file systems, e.g. using logs or journals to store data} - H04L 63/12: {Applying verification of the received information (cryptographic mechanisms or cryptographic arrangements for data integrity or data verification H04L9/32)} - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract A system, method, and computer-readable storage medium is provided for creating first and second blockchain instances, each comprising representative blocks corresponding to steps in first and second multistep processes, respectively; performing a linking operation to link a block in the first blockchain instance to a block in the second blockchain instance; receiving change evidence data pertaining to steps in one of the first and second multi-step processes; and performing an update operation comprising updating one of the first and second blockchain instances based on said change evidence data. ## Claims ### Claim 1 A computer-implemented method, comprising: storing, in a blockchain system, at least one generic finite blockchain comprising representative blocks, each corresponding to a step in a multi-step process; dynamically generating at least one finite blockchain instance based on said at least one generic finite blockchain; operating the system in a first mode wherein a first block is created in the finite blockchain instance based on change evidence data pertaining to at least one step in said multi-step process; wherein the change evidence data comprises information indicating that the step has completed; and recording the change evidence data in the first block; and operating the system in a second mode comprising identifying a promised block in the at least one generic finite blockchain, wherein the promised block corresponds to a successive step in the multi-step process that is dependent on a prior step in said process corresponding to a preceding block in the at least one generic finite blockchain; and creating a block in the at least one finite blockchain instance corresponding to the promised block based on a likelihood that the prior step will complete. ### Claim 2 (depends on 1) The computer-implemented method of claim 1, further comprising receiving input on the likelihood. ### Claim 3 (depends on 1) The computer-implemented method of claim 1, further comprising associating an effort with each block in the generic, where the effort represents the resources needed to complete the step associated with the block. ### Claim 4 (depends on 3) The computer-implemented method of claim 3, wherein the effort is measured in terms of the resources comprising at least one of money and labor. ### Claim 5 (depends on 3) The computer-implemented method of claim 3, further comprising releasing the effort. ### Claim 6 (depends on 1) The computer-implemented method of claim 1, wherein the likelihood is computed based on an algorithm. ### Claim 7 (depends on 9) A system, comprising: a memory; a processor communicatively coupled to the memory, wherein the processor is configured to perform: storing, in a blockchain system, at least one generic finite blockchain comprising representative blocks, each corresponding to a step in a multi-step process; dynamically generating at least one finite blockchain instance based on said at least one generic finite blockchain; operating the system in a first mode wherein a first block is created in the finite blockchain instance based on change evidence data pertaining to at least one step in said multi-step process; wherein the change evidence data comprises information indicating that the step has completed; and recording the change evidence data in the first block; and operating the system in a second mode comprising identifying a promised block in the at least one generic finite blockchain, wherein the promised block corresponds to a successive step in the multi-step process that is dependent on a prior step in said process corresponding to a preceding block in the at least one generic finite blockchain; and creating a block in the at least one finite blockchain instance corresponding to the promised block based on a likelihood that the prior step will complete.10. The system of claim 9, further comprising associating each of the first and second bloc chain instances to a corresponding generic finite blockchain. ### Claim 8 (depends on 7) The system of claim 7, further comprising receiving input on the likelihood. ### Claim 9 (depends on 7) The system of claim 7, further comprising associating an effort with each block in the generic, where the effort represents the resources needed to complete the step associated with the block. ### Claim 10 (depends on 9) The system of claim 9, wherein the effort is measured in terms of the resources comprising at least one of money and labor. ### Claim 11 (depends on 9) The system method of claim 9, further comprising releasing the effort. ### Claim 12 (depends on 7) The system of claim 7, wherein the likelihood is computed based on an algorithm. ### Claim 13 A non-transitory computer program product comprising a computer-readable storage medium having computer readable program code embodied therewith, the computer readable program code configured to perform: storing, in a blockchain system, at least one generic finite blockchain comprising representative blocks, each corresponding to a step in a multi-step process; dynamically generating at least one finite blockchain instance based on said at least one generic finite blockchain; operating the system in a first mode wherein a first block is created in the finite blockchain instance based on change evidence data pertaining to at least one step in said multi-step process; wherein the change evidence data comprises information indicating that the step has completed; and recording the change evidence data in the first block; and operating the system in a second mode comprising identifying a promised block in the at least one generic finite blockchain, wherein the promised block corresponds to a successive step in the multi-step process that is dependent on a prior step in said process corresponding to a preceding block in the at least one generic finite blockchain; and creating a block in the at least one finite blockchain instance corresponding to the promised block based on a likelihood that the prior step will complete. ### Claim 14 (depends on 13) The non-transitory computer program product of claim 13, further comprising associating each of the first and second bloc chain instances to a corresponding generic finite blockchain. ### Claim 15 (depends on 13) The non-transitory computer program product of claim 13, further comprising receiving input on the likelihood. ### Claim 16 (depends on 13) The non-transitory computer program product of claim 13, further comprising associating an effort with each block in the generic, where the effort represents the resources needed to complete the step associated with the block. ### Claim 17 (depends on 16) The non-transitory computer program product of claim 16, wherein the effort is measured in terms of the resources comprising at least one of money and labor. ### Claim 18 (depends on 16) The non-transitory computer program product of claim 16, further comprising releasing the effort. ### Claim 18 (depends on 13) The computer-implemented method of claim 13, wherein the likelihood is computed based on an algorithm.