<oembed><type>rich</type><version>1.0</version><title>ZmnSCPxj [ARCHIVE] wrote</title><author_name>ZmnSCPxj [ARCHIVE] (npub1g5…3ms3l)</author_name><author_url>https://yabu.me/npub1g5zswf6y48f7fy90jf3tlcuwdmjn8znhzaa4vkmtxaeskca8hpss23ms3l</author_url><provider_name>njump</provider_name><provider_url>https://yabu.me</provider_url><html>📅 Original date posted:2021-06-02&#xA;📝 Original message:&#xA;Good morning again LL,&#xA;&#xA;So I started thinking as well, about Decker-Russell-Osuntokun and the Fast Forwards technique, as well as your &#34;desync&#34; idea.&#xA;&#xA;And it seems to me that we can also adapt a variant of this idea with Decker-Russell-Osuntokun, with the advantage of **not** requiring the additional encumbrance at the outputs.&#xA;&#xA;The technique is that we allow Bob the receiver to have possession of *later* states while Alice the sender only possesses an old state.&#xA;&#xA;Alice sends the signatures for a new state (update + settlement) whenever it offers an HTLC to Bob, and whenever Bob fulfills the HTLC.&#xA;However, Alice *does not* wait for Bob to return signatures for a new state.&#xA;So Alice remains stuck with the old state.&#xA;&#xA;* Suppose Alice wants to close the channel unilaterally.&#xA;  * Alice broadcasts the old update tx.&#xA;  * Bob has an incentive to bring its latest state onchain (bringing its privkey online and signing the latest update).&#xA;    * All the payments are in the Alice-&gt;Bob direction.&#xA;  * Even though Alice broadcasted an old state, it does not lose money since Decker-Russell-Osuntokun is non-punitive.&#xA;* Bob can bring its privkey online to close the channel unilaterally with the latest state.&#xA;&#xA;So it looks to me that Decker-Russell-Osuntokun similarly does **not** require the additional encumbrance at the &#34;main&#34; outputs.&#xA;We simply allow the sender to remain at an older state.&#xA;&#xA;So let us give a concrete example.&#xA;&#xA;* Alice and Bob start at state 1: Alice = 50, Bob = 50.&#xA;* Alice offers a HTLC of value 10.&#xA;  * Alice: state 1: Alice = 50, Bob = 50&#xA;  * Bob: state 2: Alice = 40, Bob = 50, A-&gt;B HTLC = 10&#xA;* Bob fulfills, so Alice sends a new state.which transfers the A-&gt;B HTLC value to Bob.&#xA;  * Alice: state 1: Alice = 50, Bob = 50&#xA;  * Bob: state 3: Alice = 40, Bob = 60&#xA;* Bob brings its privkey online because it wants to send out via Alice (a forwarder).&#xA;  It offers an HTLC B-&gt;A of value 20.&#xA;  * Alice: state 4: Alice = 40, Bob = 40, B-&gt;A HTLC = 20&#xA;  * Bob: state 3: Alice = 40, Bob = 60&#xA;&#xA;Because publishing old state is &#34;safe&#34; under Decker-Russell-Osuntokun, it is fine for one participant to have *only* an older state!&#xA;And we can arrange the incentives so that the one with the latest state is the one who is most incentivized to publish the latest state.&#xA;&#xA;(We should probably change the subject of this thread BTW)&#xA;&#xA;Another advantage here is that unlike the Poon-Dryja Fast Forwards, we do *not* build up a long chain of HTLC txes.&#xA;At the worst case, we have an old update tx that is superseded by a later update tx instead, thus the overhead is expected to be at most 1 extra update tx no matter how many HTLCs are offered while Bob has its privkey offline.&#xA;&#xA;&#xA;&#xA;Regards,&#xA;ZmnSCPxj</html></oembed>