Granted Patent B1

US 11,831,749 · App. 16/844,204 · Granted Nov 28, 2023

Inventors: Justin Fisher (Delray Beach, FL); Maxwell Sanchez (Albuquerque, NM)

Assignee: VeriBlock, Inc.

H04L9/0637H04L9/3247G06Q20/065

Abstract

Claims (18)

1. A system for improving the reliability of block chain fork resolution, the system comprising:

one or more identifiers of subordinate blockchain forks that indicate a plurality of potential competing subchains;

one or more calculators of a proof-of-publication score of each alternative potential competing subchain, wherein the proof-of-publication scores are based on publications of at least one component block of at least one of the potential competing subchains recorded in a master blockchain, the master blockchain having a consensus protocol that is different from a consensus protocol of the subordinate blockchain;

one or more recorders of the proof-of-publication scores;

one or more subchain removers; and

one or more subchain incorporators;

in which the system is configured to operate using nonfederated nodes.

2. A method implemented on nodes of a blockchain for improving block chain fork resolution, the method comprising:

identifying blockchain forks on a subordinate blockchain;

mapping a number of competing subchains that result from the identified blockchain forks;

calculating a relative proof-of-publication score of each competing subchain based on at least one proof of publication related to at least one of the subchains received from a master blockchain, wherein the proof-of-publication scores are based on publications of at least one component block of at least one of the potential competing subchains recorded in a master blockchain, the master blockchain having a consensus protocol that is different from a consensus protocol of the subordinate blockchain;

recording the relative proof-of-publication score and a reference to the competing subchains that resulted in the proof-of-publication score;

removing a subchain from the blockchain network if a competing subchain with a higher relative proof-of-publication score is found;

adding a subchain to the blockchain network if the subchain has a higher relative proof-of publication score than competing subchains.

3. The method of claim 2 , wherein the proof-of-publication score of a competing subchain is a sum of the proof-of-publication scores of its component blocks.

4. The method of claim 3 , wherein the proof-of-publication score of a component block of a subchain is a function of a quantity of proof-of-publications of the block in subsequent subchain blocks in the same subchain and a measure of the timeliness of the proof-of-publications of the block.

5. The method of claim 4 , wherein the measure of timeliness of a component block is relative to a block of corresponding position of a competing subchain.

6. The method of claim 5 , wherein the timeliness is ascertained from a base time that is the earlier time of publication to a master blockchain between the block and the corresponding block on the competing subchain such that the closer to the base time that a that the block's publication occurred, the greater a weight is given to the block for proof-of-publication scoring purposes.

Assignments (1)

Continuity (1)

Cited By (11)

US 12,200,137 US 12,206,790 US 12,223,501 US 12,231,573 US 12,231,574 US 12,238,222 US 12,254,468 US 12,273,460 US 12,348,648 US 12,432,070 US 12,443,953