Cascading family of blockchains

1. A computer-implemented method, comprising:

performing by blockchain system:

creating first and second blockchain instances, each comprising representative blocks corresponding to steps in first and second multistep processes, defined respectively in first and second generic blockchains;

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;

performing an update operation comprising updating one of the first and second blockchain instances with a state transition block to record said change evidence data; wherein said state transition block is linked to an initial block.

2. The computer-implemented method of claim 1 , further comprising associating each of the first and second blockchain instances to a corresponding generic finite blockchain.

3. The computer-implemented method of claim 2 , further comprising creating multiple first and second blockchain instances, each corresponding to generic finite blockchain comprising a sequence of blocks representing idealized steps corresponding to the first and second multistep processes, respectively, the sequence having a beginning and an end.

4. The computer-implemented method of claim 3 , further comprising creating at least one blockchain family comprising each instance blockchain and the associated generic finite blockchain.

5. The computer-implemented method of claim 3 , further comprising associating a start time and an end time with each instance blockchain wherein the start time represents a counter value associated with a block in the instance blockchain mapped to the beginning of the idealized sequence in the generic family blockchain, and the end time represents a counter value associated with a block in the instance blockchain mapped to the end of the idealized sequence in the generic family blockchain.

6. The computer-implemented method of claim 5 , further comprising measuring execution time for each instance blockchain based on the start and end times.

7. The computer-implemented method of claim 6 , wherein the start time for the second instance block time is less than the end time of the first instance blockchain.

8. The computer-implemented method of claim 6 , wherein the start time for the second instance blockchain is greater than the end time of the first instance blockchain.

9. A system, comprising:

a memory;

a processor communicatively coupled to the memory, wherein the processor is configured to perform:

creating first and second blockchain instances, each comprising representative blocks corresponding to steps in first and second multistep processes, defined respectively in first and second finite generic blockchains;

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;

performing an update operation comprising updating one of the first and second blockchain instances with a state transition block to record said change evidence data; wherein said state transition block is linked to an initial block.

10. The system of claim 9 , further comprising associating each of the first and second bloc chain instances to a corresponding generic finite blockchain.

11. The system of claim 10 , further comprising creating multiple first and second blockchain instances, each corresponding to generic finite blockchain comprising a sequence of blocks representing idealized steps corresponding to the first and second multistep processes, respectively, the sequence having a beginning and an end.

12. The system of claim 11 , further comprising creating at least one blockchain family comprising each instance blockchain and the associated generic finite blockchain.

13. The system of claim 11 , further comprising associating a start time and an end time with each instance blockchain wherein the start time represents a counter value associated with a block in the instance blockchain mapped to the beginning of the idealized sequence in the generic family blockchain, and the end time represents a counter value associated with a block in the instance blockchain mapped to the end of the idealized sequence in the generic family blockchain.

14. The system of claim 13 , further comprising measuring execution time for each instance bloc chain based on the start and end times.

15. The system of claim 14 , wherein the start time for the second instance block time is less than the end time of the first instance blockchain.

16. The system method of claim 14 , wherein the start time for the second instance blockchain is greater than the end time of the first instance blockchain.

17. 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:

performing by blockchain system:

creating first and second blockchain instances, each comprising representative blocks corresponding to steps in first and second multistep processes, defined respectively in first and second finite generic blockchains;

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;

performing an update operation comprising updating one of the first and second blockchain instances with a state transition block to record said change evidence data; wherein said state transition block is linked to an initial block.

18. The non-transitory computer program product of claim 17 , wherein dynamically generating the at least one finite blockchain instance comprises creating a block within said finite blockchain instance based on a tick provided by a counter associated with said blockchain instance.

19. The non-transitory computer program product of claim 18 , wherein the method further comprises associating each of the first and second blockchain instances to a corresponding generic finite blockchain.

20. The non-transitory computer program product of claim 18 , wherein the method further comprises creating multiple first and second blockchain instances, each corresponding to generic finite blockchain comprising a sequence of blocks representing idealized steps corresponding to the first and second multistep processes, respectively, the sequence having a beginning and an end.