<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <updated>2023-06-09T12:20:36Z</updated>
  <generator>https://yabu.me</generator>

  <title>Nostr notes by Orfeas Stefanos Thyfronitis Litos [ARCHIVE]</title>
  <author>
    <name>Orfeas Stefanos Thyfronitis Litos [ARCHIVE]</name>
  </author>
  <link rel="self" type="application/atom+xml" href="https://yabu.me/npub1h9v94vzhwug6qdxzldyy8vfg4vyxhftwqhalec5vjwr8hfx0fnzst9dv32.rss" />
  <link href="https://yabu.me/npub1h9v94vzhwug6qdxzldyy8vfg4vyxhftwqhalec5vjwr8hfx0fnzst9dv32" />
  <id>https://yabu.me/npub1h9v94vzhwug6qdxzldyy8vfg4vyxhftwqhalec5vjwr8hfx0fnzst9dv32</id>
  <icon></icon>
  <logo></logo>




  <entry>
    <id>https://yabu.me/nevent1qqsthpszrn6mr8wj8m20ermdrjnhy40rq4dg84rxh40r7u58j53wflqzyzu4sk4s2am3rgp5cta5ssa39z4ss6a9dczlhl8z3jfcv7ayeaxv2h2ffu2</id>
    
      <title type="html">📅 Original date posted:2019-11-22 📝 Original message: Good ...</title>
    
    <link rel="alternate" href="https://yabu.me/nevent1qqsthpszrn6mr8wj8m20ermdrjnhy40rq4dg84rxh40r7u58j53wflqzyzu4sk4s2am3rgp5cta5ssa39z4ss6a9dczlhl8z3jfcv7ayeaxv2h2ffu2" />
    <content type="html">
      In reply to &lt;a href=&#39;/nevent1qqs2726uwjgvkrjzl5yr8vu0w604xy622l94jdhgpuwdptacyluegqsrfzg7u&#39;&gt;nevent1q…zg7u&lt;/a&gt;&lt;br/&gt;_________________________&lt;br/&gt;&lt;br/&gt;📅 Original date posted:2019-11-22&lt;br/&gt;📝 Original message:&lt;br/&gt;Good morning ZmnSCPxj,&lt;br/&gt;&lt;br/&gt;&amp;gt; requiring a fee is equivalent to requiring proof-of-work, incentive-wise.&lt;br/&gt;&lt;br/&gt;Not necessarily, given that&lt;br/&gt;1) there is a finite bitcoin supply but an eventually infinite PoW&lt;br/&gt;supply (relevant in the unlikely case fees are burned)&lt;br/&gt;2) sats are transferrable, whereas PoW isn&amp;#39;t (relevant in the case fees&lt;br/&gt;are paid)&lt;br/&gt;&lt;br/&gt;On the other hand, there exists this paper with the fancy name that&lt;br/&gt;claims using PoW for spam prevention in the context of email (the&lt;br/&gt;original context in which PoW was discovered) is ineffective due to the&lt;br/&gt;high per-message PoW required to beat spam [0]. Therefore we have to see&lt;br/&gt;whether this paper applies to LN as well before going down that road.&lt;br/&gt;&lt;br/&gt;Spam prevention in an unauthenticated system is much more complex than&lt;br/&gt;it seems at first, because it boils down to avoiding the Sybil attack,&lt;br/&gt;(one of) the most difficult problem(s) in such systems. A (traditional)&lt;br/&gt;reputation system in essence enables authentication (eww), per-message&lt;br/&gt;PoW might be too expensive, and per-message fees seem to have incentives&lt;br/&gt;issues and are kind of misaligned with LN&amp;#39;s aims.&lt;br/&gt;&lt;br/&gt;Maybe I&amp;#39;ve missed something, but what makes spam in LN a bigger problem&lt;br/&gt;than it is in every other p2p network out there? Why won&amp;#39;t traditional&lt;br/&gt;bad activity thresholds do the job?&lt;br/&gt;&lt;br/&gt;I don&amp;#39;t think spam is something that will be completely wiped out, only&lt;br/&gt;contained. LN should provide for many orthogonal spam prevention&lt;br/&gt;measures (local tunable activity thresholds, gossipable reputation&lt;br/&gt;systems (eww), per-message fees, per-message PoW) with sensible defaults&lt;br/&gt;to allow users to experiment and choose what is best for them, but that&lt;br/&gt;may lead to unacceptable protocol and UI complexity. What a tradeoff...&lt;br/&gt;&lt;br/&gt;Best,&lt;br/&gt;Orfeas&lt;br/&gt;&lt;br/&gt;[0] &lt;a href=&#34;https://www.cl.cam.ac.uk/~rnc1/proofwork.pdf&#34;&gt;https://www.cl.cam.ac.uk/~rnc1/proofwork.pdf&lt;/a&gt;&lt;br/&gt;&lt;br/&gt;-- &lt;br/&gt;The University of Edinburgh is a charitable body, registered in&lt;br/&gt;Scotland, with registration number SC005336.
    </content>
    <updated>2023-06-09T12:57:10Z</updated>
  </entry>

  <entry>
    <id>https://yabu.me/nevent1qqs2726uwjgvkrjzl5yr8vu0w604xy622l94jdhgpuwdptacyluegqszyzu4sk4s2am3rgp5cta5ssa39z4ss6a9dczlhl8z3jfcv7ayeaxv2sks3d6</id>
    
      <title type="html">📅 Original date posted:2019-11-26 📝 Original message: Hello ...</title>
    
    <link rel="alternate" href="https://yabu.me/nevent1qqs2726uwjgvkrjzl5yr8vu0w604xy622l94jdhgpuwdptacyluegqszyzu4sk4s2am3rgp5cta5ssa39z4ss6a9dczlhl8z3jfcv7ayeaxv2sks3d6" />
    <content type="html">
      In reply to &lt;a href=&#39;/nevent1qqsvn8v75fe70aykgjq59hqxphzslyglsvjy8x97lk7v4uuprt8wrcs4ad9jn&#39;&gt;nevent1q…d9jn&lt;/a&gt;&lt;br/&gt;_________________________&lt;br/&gt;&lt;br/&gt;📅 Original date posted:2019-11-26&lt;br/&gt;📝 Original message:&lt;br/&gt;Hello ZmnSCPxj,&lt;br/&gt;&lt;br/&gt;&amp;gt; This can be made &amp;#34;the same&amp;#34; by any of the following methods:&lt;br/&gt;&amp;gt; &lt;br/&gt;&amp;gt; * Burning the up-front fees.&lt;br/&gt;&lt;br/&gt;This would impose a hard maximum of 21 * 10^6 * 10^8 global lifetime hops, and a much lower practical one. PoW OTOH doesn&amp;#39;t impose such limits. Hence different dynamics.&lt;br/&gt;&lt;br/&gt;&amp;gt; * Locking the up-front fees for a time, then reverting them to the original sender.&lt;br/&gt;&lt;br/&gt;This means that I can burst-spam today, wait until unlock, repeat. If the PoW scheme somehow enforces fresh PoWs (e.g. by needing (nonce || recent block hash) as proof), I can&amp;#39;t do this attack.&lt;br/&gt;&lt;br/&gt;&amp;gt; Fees and PoW are equivalent.&lt;br/&gt;&lt;br/&gt;If by &amp;#34;equivalent&amp;#34; you mean &amp;#34;a drop-in replacement&amp;#34;, then I hope the subtle differences above and the previous discussion show that this is not the case. If by &amp;#34;equivalent&amp;#34; you mean (a formal version of) &amp;#34;for any scheme that uses PoWs, there exists a fee-based scheme with the same incentives and large-scale dynamics&amp;#34;, then that&amp;#39;s a very strong claim of which I would love to see a proof (and a formal statement).&lt;br/&gt;&lt;br/&gt;This is not to say that I believe PoWs are the solution to spam, just that they warrant separate investigation from fees.&lt;br/&gt;&lt;br/&gt;Best,&lt;br/&gt;Orfeas&lt;br/&gt;&lt;br/&gt;-- &lt;br/&gt;The University of Edinburgh is a charitable body, registered in&lt;br/&gt;Scotland, with registration number SC005336.
    </content>
    <updated>2023-06-09T12:57:10Z</updated>
  </entry>

  <entry>
    <id>https://yabu.me/nevent1qqs8n7msxam9kcdegsjyxqqy2ta64jyqg2mtwmf89p57er5f9y8s6aszyzu4sk4s2am3rgp5cta5ssa39z4ss6a9dczlhl8z3jfcv7ayeaxv27qy5cv</id>
    
      <title type="html">📅 Original date posted:2019-11-25 📝 Original message: Hi ...</title>
    
    <link rel="alternate" href="https://yabu.me/nevent1qqs8n7msxam9kcdegsjyxqqy2ta64jyqg2mtwmf89p57er5f9y8s6aszyzu4sk4s2am3rgp5cta5ssa39z4ss6a9dczlhl8z3jfcv7ayeaxv27qy5cv" />
    <content type="html">
      In reply to &lt;a href=&#39;/nevent1qqsquzuyf9hmxqy083249q8rfzg9zh0gjwfr2euf7unkxtgqmv3tf2c9pljcd&#39;&gt;nevent1q…ljcd&lt;/a&gt;&lt;br/&gt;_________________________&lt;br/&gt;&lt;br/&gt;📅 Original date posted:2019-11-25&lt;br/&gt;📝 Original message:&lt;br/&gt;Hi ZmnSCPxj,&lt;br/&gt;&lt;br/&gt;&amp;gt;&amp;gt;&amp;gt; requiring a fee is equivalent to requiring proof-of-work, incentive-wise.&lt;br/&gt;&amp;gt;&amp;gt;&lt;br/&gt;&amp;gt;&amp;gt; Not necessarily, given that&lt;br/&gt;&amp;gt;&amp;gt; 1) there is a finite bitcoin supply but an eventually infinite PoW&lt;br/&gt;&amp;gt;&amp;gt; supply (relevant in the unlikely case fees are burned)&lt;br/&gt;&amp;gt;&amp;gt; 2) sats are transferrable, whereas PoW isn&amp;#39;t (relevant in the case fees&lt;br/&gt;&amp;gt;&amp;gt; are paid)&lt;br/&gt;&amp;gt; &lt;br/&gt;&amp;gt; Not actually.&lt;br/&gt;&amp;gt; Again, let me point out that PoW can be *bought*, that is precisely what Bitcoin blockchain layer does.&lt;br/&gt;&amp;gt; And the blockchain layer PoW is bought with two things: fees and subsidies (inflation).&lt;br/&gt;&amp;gt; Thus PoW, being purchaseable, is incentive-wise equivalent to paying somebody to spend electricity (possibly with efficiencies at scale).&lt;br/&gt;&amp;gt; Just cut the middleman.&lt;br/&gt;&lt;br/&gt;I wasn&amp;#39;t clear enough, sorry for that. I agree that in general PoW can&lt;br/&gt;be bought. However if I understand this particular PoW proposal&lt;br/&gt;correctly, a brand-new PoW has to be created for each intermediary.&lt;br/&gt;These PoWs cannot be reused by the intermediary for later payments (or&lt;br/&gt;for anything else).&lt;br/&gt;&lt;br/&gt;I will now show that there exist spam-prevention schemes that differ&lt;br/&gt;only on whether the payer gives sats or PoWs to intermediaries, such&lt;br/&gt;that economically rational agents are incentivized to cheat in the case&lt;br/&gt;of sats but not so in the case of PoWs. This proves that fees are *not*&lt;br/&gt;equivalent to PoWs incentive-wise.&lt;br/&gt;&lt;br/&gt;In our model, an intermediary can follow one of three possible&lt;br/&gt;strategies (we make the assumption that other strategies are strictly&lt;br/&gt;dominated by one of the three). Each strategy results in different&lt;br/&gt;resource utilization and proceeds from fees.&lt;br/&gt;  (A) do nothing. This results in resources_A = 0 and sats_A = 0&lt;br/&gt;  (B) play honestly. resources_B &amp;lt; 0 (negative because they constitute&lt;br/&gt;an operating cost) and sats_B = anti_spam_fee &#43; routing_fee&lt;br/&gt;  (C) mount a plausibly deniable attack. Here resources_C &amp;lt; 0 and sats_C&lt;br/&gt;= anti_spam_fee.&lt;br/&gt;We assume that resources_C &amp;gt; resources_B &#43; routing_fee (1).&lt;br/&gt;&lt;br/&gt;In case intermediaries receive PoWs as an anti-spam measure, it is&lt;br/&gt;anti_spam_fee = 0 which means that resources_C &#43; sats_C &amp;lt; 0 =&lt;br/&gt;resources_A &#43; sats_A, therefore strategy C is strictly dominated by A.&lt;br/&gt;(The fact that A also strictly dominates B is an interesting&lt;br/&gt;observation, but beside the point for the argument made.)&lt;br/&gt;&lt;br/&gt;OTOH, in the case of anti-spam sats, it is anti_spam_fee &amp;gt; 0. Therefore&lt;br/&gt;we have resources_C &#43; sats_C &amp;gt; resources_B &#43; sats_B (using (1)) and for&lt;br/&gt;a big enough anti_spam_fee, it is resources_C &#43; sats_C &amp;gt; 0, therefore&lt;br/&gt;strategy C strictly dominates both A and B.&lt;br/&gt;&lt;br/&gt;In other words, by just changing whether we use anti-spam PoWs or fees,&lt;br/&gt;we change the economically rational behavior.&lt;br/&gt;&lt;br/&gt;I apologize for the previous ambiguity and I hope this has made my&lt;br/&gt;argument clearer.&lt;br/&gt;&lt;br/&gt;Best,&lt;br/&gt;Orfeas&lt;br/&gt;&lt;br/&gt;-- &lt;br/&gt;The University of Edinburgh is a charitable body, registered in&lt;br/&gt;Scotland, with registration number SC005336.
    </content>
    <updated>2023-06-09T12:57:09Z</updated>
  </entry>

  <entry>
    <id>https://yabu.me/nevent1qqsdmrpnrh2lrmcp7c4wng0wjjzss5yc9ekspy575umpjmhcl7gf86czyzu4sk4s2am3rgp5cta5ssa39z4ss6a9dczlhl8z3jfcv7ayeaxv2m0uy9h</id>
    
      <title type="html">📅 Original date posted:2019-07-10 📝 Original message: Hi ...</title>
    
    <link rel="alternate" href="https://yabu.me/nevent1qqsdmrpnrh2lrmcp7c4wng0wjjzss5yc9ekspy575umpjmhcl7gf86czyzu4sk4s2am3rgp5cta5ssa39z4ss6a9dczlhl8z3jfcv7ayeaxv2m0uy9h" />
    <content type="html">
      In reply to &lt;a href=&#39;/nevent1qqsyufk3fenf3t4jutetpxnrl7hle3aylc2p6k80s3pvs9jfvtey98glyedfg&#39;&gt;nevent1q…edfg&lt;/a&gt;&lt;br/&gt;_________________________&lt;br/&gt;&lt;br/&gt;📅 Original date posted:2019-07-10&lt;br/&gt;📝 Original message:&lt;br/&gt;Hi all,&lt;br/&gt;&lt;br/&gt;The promise for fast, scalable, user-friendly and trustless use of&lt;br/&gt;bitcoin that the Lightning Network offers motivated us to author a paper&lt;br/&gt;where we formalize LN in the cryptographic framework of Universal&lt;br/&gt;Composition and prove its security. It can be found here:&lt;br/&gt;&lt;a href=&#34;https://eprint.iacr.org/2019/778&#34;&gt;https://eprint.iacr.org/2019/778&lt;/a&gt;&lt;br/&gt;&lt;br/&gt;We believe that a formal proof of security was needed to specify the&lt;br/&gt;exact operating parameters that safeguard the funds and transactions of&lt;br/&gt;users against arbitrary attackers, to abstract, modularize and validate&lt;br/&gt;the underlying cryptography that is used in LN, to incorporate LN in the&lt;br/&gt;body of cryptographic protocols that have been abstracted within the&lt;br/&gt;Universal Composition framework (and thus can be safely composed and run&lt;br/&gt;in parallel) and to increase the trust of the wider community to LN. We&lt;br/&gt;view this work as a small contribution to the amazing effort that the&lt;br/&gt;Lightning community has expended both on the theoretical and the&lt;br/&gt;practical front throughout the last years.&lt;br/&gt;&lt;br/&gt;The paper is authored by my PhD supervisor Prof. Aggelos Kiayias and me.&lt;br/&gt;Any feedback will be greatly appreciated.&lt;br/&gt;&lt;br/&gt;Best regards,&lt;br/&gt;Orfeas Stefanos Thyfronitis Litos&lt;br/&gt;&lt;br/&gt;-- &lt;br/&gt;The University of Edinburgh is a charitable body, registered in&lt;br/&gt;Scotland, with registration number SC005336.
    </content>
    <updated>2023-06-09T12:55:26Z</updated>
  </entry>

</feed>