CPC G06Q 20/401 (2013.01) [G06Q 20/3678 (2013.01); G06Q 20/389 (2013.01); H04L 9/00 (2013.01); H04L 9/0637 (2013.01); H04L 9/50 (2022.05)] | 10 Claims |
1. A method for pooling block rewards in a reward pool comprising an operator node and a set of member nodes in a distributed network extending a proof-of-space-based blockchain, the method comprising:
during an initial time period, by a first member node in the set of member nodes:
generating a plot file defining:
a set of proofs-of-space; and
a singleton puzzle hash;
storing the plot file on a storage device; and
submitting a first transaction configured to generate a first singleton based on the singleton puzzle hash, the first singleton comprising:
an outer puzzle hash linking the first singleton to the singleton puzzle hash; and
an inner puzzle hash defining a collection state of the first singleton representing:
an owner address associated with the first member node; and
a first pool address associated with the reward pool; and
during a first time period succeeding the initial time period, by the first member node:
accessing a first challenge from a first version of the blockchain;
generating a first proof-of-space, from the set of proofs-of-space, responsive to the first challenge;
broadcasting the first proof-of-space over the distributed network;
generating a first block based on the first proof-of-space, the first block comprising a block reward allocated to the singleton puzzle hash; and
broadcasting the first block over the distributed network;
during a second time period succeeding the initial time period, by the first member node:
accessing a second challenge from a second version of the blockchain;
generating a first partial proof-of-space, corresponding to a first difficulty, from the plot file; and
transmitting the first partial proof-of-space to the operator node; and
during a third time period succeeding the second time period, by the first member node:
accessing a third challenge from a third version of the blockchain;
generating a second partial proof-of-space, corresponding to a second difficulty exceeding the first difficulty, from the plot file; and
transmitting the second partial proof-of-space to the operator node.
|