Computer-implemented systems and methods relating to a binary blockchain comprising a pair of coupled blockchains
There may be provided a computer-implemented method. The computer-implemented method includes: i) after a proof-of-stake token is transferred to an address of a determined type on a proof-of-stake blockchain, adding a record of the transfer of the proof-of-stake token to the proof-of-work blockchain; ii) identifying a node, from a group of nodes, to participate in adding a block to the proof-of-stake blockchain, the identifying based on the proof-of-work blockchain; and iii) including a block submitted by the identified node in the proof-of-stake blockchain.
1. A computer-implemented method comprising:
after a proof-of-stake token is transferred to an address of a determined type on a proof-of-stake blockchain, adding a record of the transfer of the proof-of-stake token to a proof-of-work blockchain;
identifying a node, from a group of nodes, to participate in adding a block to the proof-of-stake blockchain, the identifying based on the proof-of-work blockchain, wherein the identifying comprises determining that the record is included on the proof-of-work blockchain;
including the block submitted by the identified node in the proof-of-stake blockchain; and
identifying a primary blockchain and a secondary blockchain as a true copy of the primary blockchain and the secondary blockchain by identifying the secondary blockchain containing a largest amount of work and comparing a distribution of proof-of-stake tokens from the identified secondary blockchain with a distribution of blocks mined in the primary blockchain.
2. The computer-implemented method of claim 1 , wherein identifying the node is performed deterministically according to predetermined criteria such that other nodes of a network identify a common node.
3. The computer-implemented method of claim 1 , wherein the identifying is performed using cryptographic sortition.
4. The computer-implemented method of claim 1 , wherein the group of nodes includes at least some nodes that have transferred a proof-of-stake token to an address of the determined type but excludes nodes that have transferred a proof-of-stake token to an address of the determined type if a confirmation period associated with a recordation, on the proof-of-work blockchain, of the transfer of that proof-of-stake token has not yet elapsed.
5. The computer-implemented method of claim 4 , wherein the confirmation period is a predetermined number of blocks associated with the proof-of-work blockchain.
6. The computer-implemented method of claim 1 , wherein the block generates a new token and transfers control of the new token to a node that added the record of the transfer of the proof-of-stake token to the proof-of-work blockchain.
7. The computer-implemented method of claim 1 , wherein the block generates a new token and transfers control of the new token to the identified node.
8. The computer-implemented method of claim 1 , further comprising identifying a withdrawal request issued by a node and excluding the node that issued the withdrawal request from the group of nodes.
9. The computer-implemented method of claim 8 , wherein the withdrawal request is identified from metadata of a transaction associated with the proof-of-work blockchain.
10. The computer-implemented method of claim 8 , further comprising, after an unbonding period associated with the withdrawal request, updating the proof-of-stake blockchain to return a proof-of-stake token associated with the withdrawal request to the node that issued the withdrawal request.
11. The computer-implemented method of claim 10 , wherein the unbonding period is a predetermined number of blocks associated with the proof-of-work blockchain.
12. The computer-implemented method of claim 1 , further comprising:
rejecting a block submitted by a node that is not the identified node.
13. The computer-implemented method of claim 1 , further comprising:
prior to including the block in the proof-of-stake blockchain, verifying that the block has been validated by a group of validator nodes, the group of validator nodes being a subset of the group of nodes, the validator nodes being identified based on the proof-of-work blockchain.
14. The computer-implemented method of claim 13 , wherein the group of validator nodes are configured to perform a byzantine algorithm to validate the block.
15. A non-transitory computer readable storage medium comprising computer-executable instructions which, when executed, configure a processor to perform the method of claim 1 .
16. An electronic device comprising:
an interface device;
a processor coupled to the interface device; and
a memory coupled to the processor, the memory having stored thereon computer executable instructions which, when executed, configure the processor to perform the method of claim 1 .
17. The electronic device of claim 16 , wherein the memory stores a binary blockchain comprising a proof-of-work blockchain and a proof-of-stake blockchain.