Network for improved verification speed with tamper resistant data
A method is disclosed. The method includes: a) receiving node identifiers from nodes of a plurality of nodes in a computer network; b) determining a plurality of node committees in a sampler graph comprising a plurality of nodes, wherein the node is present in a node committee in the plurality of node committees; c) and i) generating a random string; ii) performing a proof of work process using the random string and a hash function; iii) if the proof of work process yields a solution that is acceptable, then broadcasting the solution to all other nodes in the plurality of nodes, wherein the other nodes verify the solution; and iv) if the other nodes verify the solution, the node is elected to a subcommittee for the node committee, wherein the subcommittee updates the sampler graph; and d) repeating steps b) and c) until a leader committee is determined.
1 . A method comprising:
receiving, by a first node in a first committee of nodes in a computer network, a request including a node identifier to join a committee by a second node, the first committee managing a first shard of a main blockchain;
providing, by the first node of the first committee to the second node, a proof of work process, the proof of work process being a function for which the second node provides an input to produce a solution;
receiving, by first node of the first committee, the solution to the proof of work process from the second node, wherein the second node performs the proof of work process to produce the solution, wherein a plurality of nodes in the first committee verifies the solution;
generating, by the first node of the first committee, a random string;
determining, by the first node, a second committee of nodes for the second node using the random string, the second committee managing a second shard of the main blockchain;
introducing, by the first node to the second committee determined using the random string, the second node, wherein the second committee displaces a node to allow the second node to join the second committee; and
communicating, by the first node, information regarding the second node being in the second committee to other nodes in the computer network by broadcasting an IP address and a second committee identifier of the second node to the other nodes in the computer network,
wherein the nodes in the first committee have addresses including their IP addresses and a first committee identifier that identifies the first committee of nodes, and the nodes in the second committee have addresses including their IP addresses and the second committee identifier that identifies the second committee of nodes, the first committee identifier and the second committee identifier being different,
wherein the first committee of nodes is a leader committee and the nodes in the second committee of nodes are determined by hashing a random value generated by the first committee of nodes and the IP addresses of the nodes in the second committee to form a hashed value, and using a predetermined number of bits of the hashed value, and
wherein the nodes in the second committee of nodes broadcast their IP addresses and the second committee identifier to the nodes in the first committee of nodes.
2 . The method of claim 1 , wherein the second committee displaces a random number of nodes of the second committee based on the random value generated by the leader committee.
3 . The method of claim 2 , wherein displaced nodes are assigned to random inactive committees.
4 . The method of claim 1 , wherein the first node is a leader node of the first committee.
5 . The method of claim 1 , wherein the plurality of nodes in the first committee verify the solution when the solution solves the proof of work process, is less than a predetermined security value, and is received within a predetermined amount of time.
6 . The method of claim 5 , wherein the first node is a leader node of the first committee.
7 . The method of claim 1 , wherein at least two thirds of nodes in each committee in the computer network are non-malicious nodes.
8 . A first node comprising:
a processor;
a memory device; and
a computer-readable medium coupled to the processor, the computer-readable medium comprising code executable by the processor for implementing a method comprising:
receiving, by the first node in a first committee of nodes in a computer network, a request including a node identifier to join a committee by a second node, the first committee managing a first shard of a main blockchain;
providing, by the first node of the first committee to the second node, a proof of work process, the proof of work process being a function for which the second node provides an input to produce a solution;
receiving, by first node of the first committee, the solution to the proof of work process from the second node, wherein the second node performs the proof of work process to produce the solution, wherein a plurality of nodes in the first committee verifies the solution;
generating, by the first node of the first committee, a random string;
determining, by the first node, a second committee of nodes for the second node using the random string, the second committee managing a second shard of the main blockchain;
introducing, by the first node to the second committee determined using the random string, the second node, wherein the second committee displaces a node to allow the second node to join the second committee; and
communicating, by the first node, information regarding the second node being in the second committee to other nodes in the computer network by broadcasting an IP address and a second committee identifier of the second node to the other nodes in the computer network,
wherein the nodes in the first committee have addresses including their IP addresses and a first committee identifier that identifies the first committee of nodes, and the nodes in the second committee have addresses including their IP addresses and the second committee identifier that identifies the second committee of nodes, the first committee identifier and the second committee identifier being different,
wherein in the method, the first committee of nodes is a leader committee and the nodes in the second committee of nodes are determined by hashing a random value generated by the first committee of nodes and the IP addresses of the nodes in the second committee to form a hashed value, and using a predetermined number of bits of the hashed value, and
wherein the nodes in the second committee of nodes broadcast their IP addresses and the second committee identifier to the nodes in the first committee of nodes.
9 . The first node of claim 8 , wherein in the method, the second committee displaces a random number of nodes of the second committee based on a random value generated by the leader committee.
10 . The first node of claim 9 , wherein in the method, displaced nodes are assigned to random inactive committees.
11 . The first node of claim 8 , wherein the first node is a leader node of the first committee.
12 . The first node of claim 8 , wherein in the method the plurality of nodes in the first committee verify the solution when the solution solves the proof of work process, is less than a predetermined security value, and is received within a predetermined amount of time.
13 . The first node of claim 12 , wherein the first node is a leader node of the first committee.
14 . The first node of claim 8 , wherein at least two thirds of nodes in each committee in the computer network are non-malicious nodes.