IP Library Granted Patent US 11,381,384
Granted Patent B2
US 11,381,384 · App. 16/574,491 · Granted Jul 5, 2022

Blockchain system for optimizing processes

Inventors: Ganesh Krishnan (Cupertino, CA); Dharmesh Dadbhawala (San Jose, CA); Ashish Baluja (Santa Clara, CA); Bhaumik Dedhia (San Jose, CA)
Assignee: BOARDWALKTECH, INC
H04L9/0637H04L9/0643H04L2209/38
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,381,384
App. No.
16/574,491
Granted
Jul 5, 2022
Kind
B2
Abstract

A system, method, and computer-readable storage medium is provided for storing, in a blockchain system, at least one generic finite blockchain comprising representative blocks, each corresponding to at least one step in a multi-step process; dynamically generating at least one finite blockchain instance based on said at least one generic finite blockchain; receiving, by a processor, change evidence data pertaining to at least one step in said multi-step process; and performing an update operation comprising updating the at least one finite blockchain instance based on said change evidence data.

Claims (34)

1. A computer-implemented method, comprising:

storing, in a blockchain system, at least one generic finite blockchain comprising representative blocks, each corresponding to at least one step in a multi-step process;

dynamically generating at least one finite blockchain instance based on said at least one generic finite blockchain;

receiving, by a processor, change evidence data pertaining to at least one step in said multi-step process; and

performing an update operation comprising updating the at least one finite blockchain instance based on said change evidence data.

2. The computer-implemented method of claim 1 , wherein the blockchain system is accessible to a plurality of computing nodes participating in said system.

3. The computer-implemented method of claim 1 , 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.

4. The computer-implemented method of claim 1 , wherein each generic finite blockchain together with each associated finite blockchain instance defines a family of blockchains.

5. The computer-implemented method of claim 1 , wherein dynamically generating the at least one finite blockchain comprises performing an alignment operation to align each block within a finite blockchain instance with a corresponding block in the generic finite blockchain associated with said finite blockchain instance.

6. The computer-implemented method of claim 5 , wherein dynamically generating the at least one finite blockchain further comprises creating an alignment block to map aligned blocks.

7. The computer-implemented method of claim 1 , wherein each finite blockchain whether occurring as a generic or an instance comprises a means block.

8. The computer-implemented method of claim 1 , wherein each finite blockchain whether occurring as a generic or an instance comprises an ends block.

9. A system, comprising:

a memory;

a processor communicatively coupled to the memory, where in the processors configured to perform:

storing, in a blockchain system, at least one generic finite blockchain comprising representative blocks, each corresponding to at least one step in a multi-step process;

dynamically generating at least one finite blockchain instance based on said at least one generic finite blockchain;

receiving, by a processor, change evidence data pertaining to at least one step in said multi-step process; and

performing an update operation comprising updating the at least one finite blockchain instance based on said change evidence data.

10. The system of claim 9 , which is accessible to a plurality of computing nodes participating in said system.

11. The system of claim 9 , 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.

12. The system of claim 9 , wherein each generic finite blockchain together with each finite blockchain instance defines a family of blockchains.

13. The system of claim 9 , wherein dynamically generating the at least one finite blockchain comprises performing an alignment operation to align each block within a finite blockchain instance with a corresponding block in the generic finite blockchain associated with said finite blockchain instance.

14. The system of claim 13 , wherein dynamically generating the at least one finite blockchain further comprises creating an alignment block to map aligned blocks.

15. The system method of claim 9 , wherein each finite blockchain whether occurring as a generic or an instance comprises a means block.

16. The system method of claim 9 , wherein each finite blockchain whether occurring as a generic or an instance comprises an ends block.

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:

storing, in a blockchain system, at least one generic finite blockchain comprising representative blocks, each corresponding to at least one step in a multi-step process;

dynamically generating at least one finite blockchain instance based on said at least one generic finite blockchain;

receiving, by a processor, change evidence data pertaining to at least one step in said multi-step process; and

performing an update operation comprising updating the at least one finite blockchain instance based on said change evidence data.

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 dynamically generating the at least one finite blockchain comprises performing an alignment operation to align each block within a finite blockchain instance with a corresponding block in the generic finite blockchain associated with said finite blockchain instance.

20. The non-transitory computer program product of claim 18 , wherein dynamically generating the at least one finite blockchain further comprises creating an alignment block to map aligned blocks.

Assignments (2)
SECURITY INTEREST Recorded May 23, 2024
From: BOARDWALKTECH, INC.
To: CELTIC BANK CORPORATION
Reel/Frame 067504/0497 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 26, 2019
From: KRISHNAN, GANESH; DADBHAWALA, DHARMESH; BALUJA, ASHISH; DEDHIA, BHAUMIK
To: BOARDWALKTECH, INC
Reel/Frame 050495/0807 →
Continuity (1)
Related Publication 20210083846A1 · Mar 18, 2021