Systems and methods of providing immutable records, and immutable ordering of records, in a computing system are disclosed. The computing system can be a member of a blockchain network of a plurality of blockchains. Each block can include a cryptographic digest (or hash) conforming to a minimum degree of difficulty, a nonce by which the cryptographic digest was generated in conformation with the degree of difficulty, and a list of cryptographic digests of most recent blocks of participating neighbor blockchains. Blocks may be passed between blockchains of the plurality of blockchains, which enables each member of the blockchain network to verify an immutable record of data transactions free of the mutual trust requirement of a typical blockchain environment. In conjunction with the generation of each block, an event record may be entered into an event log of the computing system wherein the block was generated. The event record, which may contain actionable instructions, requests, etc., may be transmitted to computing systems of participating neighbor blockchains, where actionable items may be acted upon. Further, the event logs of each computing system may be exchanged, compared, and adjusted to reflect the earliest appearance of each block of each participating neighbor blockchain.
Legal claims defining the scope of protection, as filed with the USPTO.
2. The system of claim 1, wherein the one or more processors are further configured to receive from the first neighbor computing system the most recent block digest of a first participating neighbor series of blocks and a collection of contributing block digests of the most recent block of the first participating neighbor series of blocks.
3. The system of claim 2, wherein the one or more processors are further configured to create a next block of the principal series of blocks, the next block linked to the new most recent block by including the new block digest, the next block also linked to the most recent block of the first neighbor series of blocks by including the block digest of the most recent block of the first neighbor series of blocks.
4. The system of claim 2, wherein the one or more processors are further configured to store a principal event log including an ordered listing of event records each corresponding to a transaction record of the record data stored in the principal series of blocks.
5. The system of claim 4, wherein the one or more processors are further configured to store, to the principal event log, an event record indicating creation of the new most recent block.
7. The system of claim 6, wherein the first neighbor computing system is in electronic communication with the one or more processors, the first neighbor computing system to record to the first neighbor event log an ordered listing of event records each corresponding to a transaction record included in the record data of a participating neighbor series of blocks.
9. The system of claim 8, wherein the one or more processors are further configured to receive from the second neighbor computing system the most recent block digest of the second participating neighbor series of blocks and a collection of contributing block digests of the most recent block of the second participating neighbor series of blocks.
10. The system of claim 1, wherein the record data of the principal blockchain comprises a plurality of transaction records.
16. The method of claim 15, wherein the first neighbor computing system is configured to record to the first neighbor event log an ordered listing of event records each corresponding to a transaction record included in the record data of a participating neighbor series of blocks.
19. The method of claim 11, wherein the record data of the principal series of blocks comprises a plurality of transaction records.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
January 27, 2023
August 27, 2024
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.