MIME-Version: 1.0
References: <CAHAXnDXhAFQHiBCJ=H=1ZGHdHWhgLh1rG3pCPR5o48ziZzV+zQ@mail.gmail.com>
 <CAE-z3OVCcAL2x39TswA8zrZ+yjSqdx4hccTWn9Ug8MQ5=k-Pgg@mail.gmail.com>
 <Y9rFseQ13QJ0TspORM_a542mUib8lJV2IiDe8GXS5SrxkvXbVI13MfbgGqVoSVftumcYNBBKut6Fz840ehS5VfvF2AsO_qNTyzvs6tTCpBk=@protonmail.com>
In-Reply-To: <Y9rFseQ13QJ0TspORM_a542mUib8lJV2IiDe8GXS5SrxkvXbVI13MfbgGqVoSVftumcYNBBKut6Fz840ehS5VfvF2AsO_qNTyzvs6tTCpBk=@protonmail.com>
From: Tier Nolan <tier.nolan@gmail.com>
Date: Mon, 17 Aug 2020 22:55:04 +0100
Message-ID: <CAE-z3OVuBGs=QxvyFMw30FZVimYWUQc_KAxKS=A-tjwVCFSbwQ@mail.gmail.com>
To: Bitcoin Protocol Discussion <bitcoin-dev@lists.linuxfoundation.org>
Content-Type: multipart/alternative; boundary="000000000000cf775305ad19d414"
Subject: Re: [bitcoin-dev] reviving op_difficulty
Precedence: list

--000000000000cf775305ad19d414
Content-Type: text/plain; charset="UTF-8"

On Mon, Aug 17, 2020 at 6:04 AM ZmnSCPxj <ZmnSCPxj@protonmail.com> wrote:

> Taproot MAST to the rescue.
>

Another option would be a binary payout

You pay 64 + 32 + 16 + 8 + 4 + 2 + 1 as outputs.  The outputs are
enabled/disabled based on the diff value.  This would require division and
also binary operators.

D = (int) ((100 * diff) / (1 trillion))

Output 0: 1.28:  If (D & 128) then pay Alice otherwise Bob
Output 0: 0.64:  If (D & 64) then pay Alice otherwise Bob
Output 0: 0.32:  If (D & 32) then pay Alice otherwise Bob
Output 0: 0.16:  If (D & 16) then pay Alice otherwise Bob
Output 0: 0.8:  If (D & 8) then pay Alice otherwise Bob
Output 0: 0.4:  If (D & 4) then pay Alice otherwise Bob
Output 0: 0.4:  If (D & 4) then pay Alice otherwise Bob
Output 0: 0.4:  If (D & 4) then pay Alice otherwise Bob

This has log performance in terms of the number of ticks like the MAST
solution.

--000000000000cf775305ad19d414
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><div dir=3D"ltr"><br></div><br><div class=3D"gmail_quote">=
<div dir=3D"ltr" class=3D"gmail_attr">On Mon, Aug 17, 2020 at 6:04 AM ZmnSC=
Pxj &lt;<a href=3D"mailto:ZmnSCPxj@protonmail.com">ZmnSCPxj@protonmail.com<=
/a>&gt; wrote:<br></div><blockquote class=3D"gmail_quote" style=3D"margin:0=
px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex">
Taproot MAST to the rescue.<br></blockquote><br></div><div class=3D"gmail_q=
uote">Another option would be a binary payout</div><div class=3D"gmail_quot=
e"><br></div><div>You pay 64 + 32 + 16 + 8 + 4 + 2 + 1 as outputs.=C2=A0 Th=
e outputs are enabled/disabled based on the diff value.=C2=A0 This would re=
quire division and also binary operators.</div><div><br></div><div>D =3D (i=
nt) ((100 * diff) / (1 trillion))<br></div><div class=3D"gmail_quote"><div>=
=C2=A0</div><div>
Output 0: 1.28:=C2=A0 If (D &amp; 128) then pay Alice otherwise Bob

</div>
<div>
Output 0: 0.64:=C2=A0 If (D &amp; 64) then pay Alice otherwise Bob

</div>


<div>Output 0: 0.32:=C2=A0 If (D &amp; 32) then pay Alice otherwise Bob<br>=
</div>


<div>Output 0: 0.16:=C2=A0 If (D &amp; 16) then pay Alice otherwise Bob<br>=
</div>


<div>Output 0: 0.8:=C2=A0 If (D &amp; 8) then pay Alice otherwise Bob<br></=
div>


<div>
Output 0: 0.4:=C2=A0 If (D &amp; 4) then pay Alice otherwise Bob <br></div>=
<div>
Output 0: 0.4:=C2=A0 If (D &amp; 4) then pay Alice otherwise Bob <br></div>=
<div>
Output 0: 0.4:=C2=A0 If (D &amp; 4) then pay Alice otherwise Bob <br></div>=
<div><br></div><div>This has log performance in terms of the number of tick=
s like the MAST solution.<br></div></div></div>

--000000000000cf775305ad19d414--