<span class="text_page_counter">Trang 1</span><div class="page_container" data-page="1">
Basic features of Bitcoin’s puzzle
The puzzle is difficult to solve, so … but not too hard, so honest
</div><span class="text_page_counter">Trang 2</span><div class="page_container" data-page="2">
•
</div><span class="text_page_counter">Trang 3</span><div class="page_container" data-page="3">
– be – have
– have a chance of winning that is proportional to • Large player get only proportional
• Even small players get proportional
Consider a puzzle that takes N
N
</div><span class="text_page_counter">Trang 4</span><div class="page_container" data-page="4">
Problem: fastest miner always
<small>Solution </small>
</div><span class="text_page_counter">Trang 6</span><div class="page_container" data-page="6">
Premise: the cost and performance of memory
</div><span class="text_page_counter">Trang 8</span><div class="page_container" data-page="8">
Also requires N steps, N
Is it actually ASIC resistant
<small> class="text_page_counter">Trang 9</span><div class="page_container" data-page="9">
<small>Is there a cycle of size K? If so, </small>
Cookoo Hash Cycles
<small>Example of a memory hard puzzle that’s cheap to verify</small>
</div><span class="text_page_counter">Trang 10</span><div class="page_container" data-page="10">
•
</div><span class="text_page_counter">Trang 11</span><div class="page_container" data-page="11">
between 150 MW – 900 MW power consumed
Candidates –
– Protein folding – Search for aliens
</div><span class="text_page_counter">Trang 12</span><div class="page_container" data-page="12">
Primecoin
<small>(Sunny King, 2013)</small>
Puzzle based on finding large prime numbers
</div><span class="text_page_counter">Trang 13</span><div class="page_container" data-page="13">
$100M spent on customized Bitcoin
This hardware investment is otherwise useless
Idea:
investment is useful, even if the work is
Permacoin – Mining with Storage
<small>(Miller et al., 2014)</small></div><span class="text_page_counter">Trang 14</span><div class="page_container" data-page="14">
Assume we have a large file F
For simplicity: F is chosen globally, at the
<i><b><small>c) h1 selects k segments from subset </small></b></i>
<b><small>a) Select a random nonce </small></b>
<b><small>b) h1 := H(prev || mrkl_root || PK || nonce) </small></b>
</div><span class="text_page_counter">Trang 15</span><div class="page_container" data-page="15">
The benefit must be a
Viable approaches include storage, prime-finding,
</div><span class="text_page_counter">Trang 16</span><div class="page_container" data-page="16">
Premise: Bitcoin’s core value is
If power is consolidated in a few large pools, the
Position: Large pools should be discouraged
</div><span class="text_page_counter">Trang 17</span><div class="page_container" data-page="17">
<b><small>GHash.IO large mining </small></b>
</div><span class="text_page_counter">Trang 18</span><div class="page_container" data-page="18">
Pools only work because the “shares” protocol lets
<b>members </b>
</div><span class="text_page_counter">Trang 19</span><div class="page_container" data-page="19">
<small>Solution </small>
discards
</div><span class="text_page_counter">Trang 20</span><div class="page_container" data-page="20">
Whoever <b>FINDS</b> a solution spends the reward
– searching for a solution requires <b>SIGNING</b>, not just
</div><span class="text_page_counter">Trang 21</span><div class="page_container" data-page="21">
<small>Solution </small>
<b>(prev, mrkl_root, nonce, PK, s1, s2) </b>
<small>Signature needed to </small>
<small>Second signature </small>
</div><span class="text_page_counter">Trang 22</span><div class="page_container" data-page="22">
This puzzle discourages all
</div><span class="text_page_counter">Trang 23</span><div class="page_container" data-page="23">
<small>Spend money on power and Earn mining </small>
<small>Spend money on power and Earn mining </small>
</div><span class="text_page_counter">Trang 24</span><div class="page_container" data-page="24">
<small>• Wealth outside Bitcoin has to move </small>
</div><span class="text_page_counter">Trang 25</span><div class="page_container" data-page="25">
<b>Proof-of-Stake:</b>“Stake” of a coin grows over time as long as the coin is
<b>Proof-of-Deposit:</b>can reclaim a coin
<b>Proof-of-Activity:</b>any coin
<b>Q: </b>Is there any security that can only be gained by
YES: Then “waste” is the
</div><span class="text_page_counter">Trang 26</span><div class="page_container" data-page="26">
Many possible design goals
– Prevent ASIC miners
– Prevent large pools –
– Eliminate the need for mining hardware
</div>