<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Sybil Resistance on Bitsy Wiki</title>
    <link>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/</link>
    <description>Recent content in Sybil Resistance on Bitsy Wiki</description>
    <generator>Hugo</generator>
    <language>en</language>
    <atom:link href="https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Proof of Work</title>
      <link>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-work/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-work/</guid>
      <description>&lt;p&gt;A proof of work is a piece of data that shows its producer performed a certain amount of computation. The producer searches for a value that, combined with some fixed data and put through a hash function, gives a result below a target number. The only known way to find such a value is to try one after another, and the lower the target, the more tries it takes on average. Anyone can check a claimed value with a single hash.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Proof of Stake</title>
      <link>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-stake/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-stake/</guid>
      <description>&lt;p&gt;Proof of stake is the practice of weighting the participants in a blockchain&amp;rsquo;s consensus by how much of the chain&amp;rsquo;s own currency each has locked up in it. A participant who wants to produce or vote on blocks, a &lt;em&gt;validator&lt;/em&gt;, deposits coins in the ledger. The protocol then chooses block producers and counts votes in proportion to those deposits.&lt;/p&gt;&#xA;&lt;p&gt;The deposit is the scarce thing that keeps one party from posing as many, which makes proof of stake a &lt;a href=&#34;https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance&#34;&gt;Sybil-resistance mechanism&lt;/a&gt;. A thousand validators holding one coin each carry the same weight as one validator holding a thousand.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Proof of Space</title>
      <link>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-space/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-space/</guid>
      <description>&lt;p&gt;A proof of space is a way for a participant to show that it has set aside a large amount of disk storage. The participant first fills the storage with data that it generates itself and that has no other use. Later, when sent a random challenge, it looks up a small part of that data and returns a short answer, which the challenger can check quickly. Answering from the stored data is cheap. Answering without it means regenerating the data, which is slow.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Proof of Storage</title>
      <link>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-storage/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-storage/</guid>
      <description>&lt;p&gt;A proof of storage is a protocol by which a party holding someone else&amp;rsquo;s data shows that it still holds it, without sending the data back. The holder is sent a challenge that names a few randomly chosen pieces of the file, and it returns a short answer that it could compute only from those pieces. The checker compares the answer with a small amount of information kept from when the file was first handed over.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Proof of Burn and Proof of Transfer</title>
      <link>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-burn/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-burn/</guid>
      <description>&lt;p&gt;A proof of burn shows that someone has destroyed cryptocurrency on purpose. The coins are sent, in an ordinary transaction, to an address that nobody can spend from, and the transaction sitting permanently in that chain&amp;rsquo;s history is the proof. Anyone can check it, and the coins are gone for good. A proof of transfer is the same payment sent to other participants in place of the unspendable address.&lt;/p&gt;&#xA;&lt;p&gt;Both turn spending into standing. They have been used in two ways: once, to hand out a new token to whoever burned an old one, and continuously, as the cost of competing to produce each block of a chain. Only the second makes them a &lt;a href=&#34;https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance&#34;&gt;Sybil-resistance mechanism&lt;/a&gt;, in which the scarce resource is currency given up, the chain&amp;rsquo;s own or another chain&amp;rsquo;s. The Bitcoin wiki&amp;rsquo;s page on the idea observes that the coins burned have so far all been mined by &lt;a href=&#34;https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-work&#34;&gt;proof of work&lt;/a&gt; somewhere, so that &amp;ldquo;the ultimate source of scarcity remains the proof-of-work-mined &amp;lsquo;fuel&amp;rsquo;.&amp;rdquo;&lt;/p&gt;</description>
    </item>
    <item>
      <title>Proof of Authority</title>
      <link>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-authority/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-authority/</guid>
      <description>&lt;p&gt;Proof of authority is an arrangement in which a blockchain&amp;rsquo;s blocks are produced by a fixed list of approved signers. A block is valid if it carries the signature of a key on the list and the signer has respected the protocol&amp;rsquo;s rule for taking turns. Nobody competes for the right to produce a block and nothing is staked. What a participant needs is a place on the list, which is set when the chain starts and changed afterwards by a vote of the signers already on it.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Proof of Personhood</title>
      <link>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-personhood/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-personhood/</guid>
      <description>&lt;p&gt;A proof of personhood is a credential showing that its holder is a real human being who holds no other such credential. It says nothing else about the holder. A system that hands one to each person, and counts each credential once, gives every person exactly one voice.&lt;/p&gt;&#xA;&lt;p&gt;As a &lt;a href=&#34;https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance&#34;&gt;Sybil-resistance mechanism&lt;/a&gt; it replaces the tradable resource with the participant&amp;rsquo;s own existence. &lt;a href=&#34;https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-work&#34;&gt;Proof of work&lt;/a&gt; and &lt;a href=&#34;https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-stake&#34;&gt;proof of stake&lt;/a&gt; give more influence to whoever commits more, and the people who proposed proof of personhood meant it as an objection to that. Bryan Ford&amp;rsquo;s requirement is that it must not be feasible &amp;ldquo;to buy more (effective) voting power with more wealth, connections, or other resources&amp;rdquo;, which, he notes, &amp;ldquo;excludes investment-based foundations for decentralized systems such as proof of work or proof of stake.&amp;rdquo;&lt;/p&gt;</description>
    </item>
    <item>
      <title>Proof of Elapsed Time</title>
      <link>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-elapsed-time/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-elapsed-time/</guid>
      <description>&lt;p&gt;Proof of elapsed time is a way of choosing who produces the next block by having every validator wait for a random length of time, with the shortest wait winning. The waiting is supervised by a &lt;a href=&#34;https://wiki.bitsy.services/wiki/economics/defi/smart-contract/tee&#34;&gt;&lt;em&gt;trusted execution environment&lt;/em&gt;&lt;/a&gt;: a protected region of a processor, called an enclave, whose code the machine&amp;rsquo;s owner cannot alter and whose outputs the processor signs. The enclave draws the wait time, and when the time has passed it issues a signed certificate saying so. The validator presents that certificate as its right to publish the block.&lt;/p&gt;</description>
    </item>
    <item>
      <title>Proof of Useful Work</title>
      <link>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-useful-work/</link>
      <pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate>
      <guid>https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-useful-work/</guid>
      <description>&lt;p&gt;A proof of useful work is a &lt;a href=&#34;https://wiki.bitsy.services/wiki/economics/defi/sybil-resistance/proof-of-work&#34;&gt;proof of work&lt;/a&gt; whose computation produces something of value besides the proof. Ordinary proof of work has a miner try billions of hashes whose only product is a number below a target. The proposal is to have the miner solve a problem somebody wants solved, in a form that still shows the computation was done.&lt;/p&gt;&#xA;&lt;p&gt;The appeal is the electricity. The obstacle is that a mining puzzle needs a set of properties that useful problems rarely have, and each attempt to supply them has taken away some of the usefulness. No widely used chain runs on useful work. The idea is as old as the term proof of work: the 1999 paper that formalized proof of work also defined a &amp;ldquo;bread pudding protocol&amp;rdquo;, one in which the effort &amp;ldquo;may be reused by the verifier to achieve a separate, useful, and verifiably correct computation.&amp;rdquo;&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
