dido:public:ra:xapend:xapend.k_consensus:02_mechanism:poc
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
dido:public:ra:xapend:xapend.k_consensus:02_mechanism:poc [2021/08/13 14:00] murphy |
dido:public:ra:xapend:xapend.k_consensus:02_mechanism:poc [2021/08/13 15:37] (current) murphy |
||
|---|---|---|---|
| Line 25: | Line 25: | ||
| To draw an analogy, if lottery rewards are based on matching the most numbers on the winning ticket, then a player with a longer list of possible solutions will have better chances of winning. Additionally, the player is allowed to keep using the lottery ticket block numbers again and again repeatedly. | To draw an analogy, if lottery rewards are based on matching the most numbers on the winning ticket, then a player with a longer list of possible solutions will have better chances of winning. Additionally, the player is allowed to keep using the lottery ticket block numbers again and again repeatedly. | ||
| - | The proof-of-capacity protocol involves a two-step process that involves plotting and mining. | + | The proof-of-capacity [[dido:public:ra:xapend:xapend.a_glossary:p:protocol|protocol]] involves a two-step process that involves plotting and mining. |
| First, the hard drive is plotted: the list of all possible nonce values are created through repeated hashing of data, including a miner’s account. Each such nonce contains 8192 hashes, which are numbered from 0 to 8191. All the hashes are paired into "scoops," which means adjacent hashes are combined to form a pair of two. For instance, hash 0 and 1 constitute scoop 0, hash 2 and 3 constitute hash 1, and so on. | First, the hard drive is plotted: the list of all possible nonce values are created through repeated hashing of data, including a miner’s account. Each such nonce contains 8192 hashes, which are numbered from 0 to 8191. All the hashes are paired into "scoops," which means adjacent hashes are combined to form a pair of two. For instance, hash 0 and 1 constitute scoop 0, hash 2 and 3 constitute hash 1, and so on. | ||
dido/public/ra/xapend/xapend.k_consensus/02_mechanism/poc.1628877649.txt.gz · Last modified: 2021/08/13 14:00 by murphy
