MIME-Version: 1.0
In-Reply-To: <mailman.6363.1457481624.1673.bitcoin-dev@lists.linuxfoundation.org>
References: <mailman.6363.1457481624.1673.bitcoin-dev@lists.linuxfoundation.org>
From: Daniele Pinna <daniele.pinna@gmail.com>
Date: Wed, 9 Mar 2016 02:27:22 +0100
Message-ID: <CAEgR2PFByXpd5C7X2NUJYt+UE3ji6dd6M5LfZGQvg-QQV7fLnw@mail.gmail.com>
To: Bitcoin Dev <bitcoin-dev@lists.linuxfoundation.org>
Content-Type: multipart/alternative; boundary=001a114123c6ad12b9052d939ae2
Subject: Re: [bitcoin-dev] bitcoin-dev Digest, Vol 10, Issue 13
Precedence: list

--001a114123c6ad12b9052d939ae2
Content-Type: text/plain; charset=UTF-8

This seems unnecessarily complicated ("don't use cannon to kill mosquito"
kind of thing). If the community were interested in a realtime hashrate
rebalancing proposal one could simply adjust difficulty at each new block
using the current method.

If faster relaxation in case of adversity is required, it suspect that it
would suffice to perform a weighted average of the previous 2016 blocks
instead of the standard averaging that is currently done. It should be
possible to find an optimal weighting based on historical interblock timing
data. I look into it over the next couple of days.

dpinna


> ------------------------------
>
> Message: 3
> Date: Tue, 8 Mar 2016 22:05:07 +0000
> From: Bob McElrath <bob_bitcoin@mcelrath.org>
> To: Dave Hudson <dave@hashingit.com>
> Cc: bitcoin-dev@lists.linuxfoundation.org
> Subject: Re: [bitcoin-dev] Hardfork to fix difficulty drop algorithm
> Message-ID: <20160308220507.GA4388@mcelrath.org>
> Content-Type: text/plain; charset=us-ascii
>
> Dave Hudson via bitcoin-dev [bitcoin-dev@lists.linuxfoundation.org] wrote:
> > I think the biggest question here would be how would the difficulty
> > retargeting be changed?  Without seeing the algorithm proposal it's
> difficult
> > to assess the impact that it would have, but my intuition is that this is
> > likely to be problematic.
>
> I have no comment on whether this will be *needed* but there's a simple
> algorithm that I haven't seen any coin adopt, that I think needs to be: the
> critically damped harmonic oscillator:
>
>     http://mathworld.wolfram.com/CriticallyDampedSimpleHarmonicMotion.html
>
> In dynamical systems one does a derivative expansion.  Here we want to
> find the
> first and second derivatives (in time) of the hashrate.  These can be
> determined
> by a method of finite differences, or fancier algorithms which use a
> quadratic
> or quartic polynomial approximation.  Two derivatives are generally all
> that is
> needed, and the resulting dynamical system is a damped harmonic oscillator.
>
> A damped harmonic oscillator is basically how your car's shock absorbers
> work.
> The relevant differential equation has two parameters: the oscillation
> frequency
> and damping factor.  The maximum oscillation frequency is the block rate.
> Any
> oscillation faster than the block rate cannot be measured by block times.
> The
> damping rate is an exponential decay and for critical damping is twice the
> oscillation frequency.
>
> So, this is a zero parameter, optimal damping solution for a varying
> hashrate.
> This is inherently a numeric approximation solution to a differential
> equation,
> so questions of approximations for the hashrate enter, but that's all.
> Weak
> block proposals will be able to get better approximations to the hashrate.
>
> If solving this problem is deemed desirable, I can put some time into
> this, or
> direct others as to how to go about it.
>
> --
> Cheers, Bob McElrath
>
> "For every complex problem, there is a solution that is simple, neat, and
> wrong."
>     -- H. L. Mencken
>
>

--001a114123c6ad12b9052d939ae2
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><div class=3D"gmail_extra"><div class=3D"gmail_quote"><div=
>This seems unnecessarily complicated (&quot;don&#39;t use cannon to kill m=
osquito&quot; kind of thing). If the community were interested in a realtim=
e hashrate rebalancing proposal one could simply adjust difficulty at each =
new block using the current method. <br><br>If faster relaxation in case of=
 adversity is required, it suspect that it would suffice to perform a weigh=
ted average of the previous 2016 blocks instead of the standard averaging t=
hat is currently done. It should be possible to find an optimal weighting b=
ased on historical interblock timing data. I look into it over the next cou=
ple of days.<br></div><div><br></div><div>dpinna</div><div><br></div><div><=
br></div><div>=C2=A0</div><blockquote class=3D"gmail_quote" style=3D"margin=
:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
------------------------------<br>
<br>
Message: 3<br>
Date: Tue, 8 Mar 2016 22:05:07 +0000<br>
From: Bob McElrath &lt;<a href=3D"mailto:bob_bitcoin@mcelrath.org">bob_bitc=
oin@mcelrath.org</a>&gt;<br>
To: Dave Hudson &lt;<a href=3D"mailto:dave@hashingit.com">dave@hashingit.co=
m</a>&gt;<br>
Cc: <a href=3D"mailto:bitcoin-dev@lists.linuxfoundation.org">bitcoin-dev@li=
sts.linuxfoundation.org</a><br>
Subject: Re: [bitcoin-dev] Hardfork to fix difficulty drop algorithm<br>
Message-ID: &lt;<a href=3D"mailto:20160308220507.GA4388@mcelrath.org">20160=
308220507.GA4388@mcelrath.org</a>&gt;<br>
Content-Type: text/plain; charset=3Dus-ascii<br>
<br>
Dave Hudson via bitcoin-dev [<a href=3D"mailto:bitcoin-dev@lists.linuxfound=
ation.org">bitcoin-dev@lists.linuxfoundation.org</a>] wrote:<br>
&gt; I think the biggest question here would be how would the difficulty<br=
>
&gt; retargeting be changed?=C2=A0 Without seeing the algorithm proposal it=
&#39;s difficult<br>
&gt; to assess the impact that it would have, but my intuition is that this=
 is<br>
&gt; likely to be problematic.<br>
<br>
I have no comment on whether this will be *needed* but there&#39;s a simple=
<br>
algorithm that I haven&#39;t seen any coin adopt, that I think needs to be:=
 the<br>
critically damped harmonic oscillator:<br>
<br>
=C2=A0 =C2=A0 <a href=3D"http://mathworld.wolfram.com/CriticallyDampedSimpl=
eHarmonicMotion.html" rel=3D"noreferrer" target=3D"_blank">http://mathworld=
.wolfram.com/CriticallyDampedSimpleHarmonicMotion.html</a><br>
<br>
In dynamical systems one does a derivative expansion.=C2=A0 Here we want to=
 find the<br>
first and second derivatives (in time) of the hashrate.=C2=A0 These can be =
determined<br>
by a method of finite differences, or fancier algorithms which use a quadra=
tic<br>
or quartic polynomial approximation.=C2=A0 Two derivatives are generally al=
l that is<br>
needed, and the resulting dynamical system is a damped harmonic oscillator.=
<br>
<br>
A damped harmonic oscillator is basically how your car&#39;s shock absorber=
s work.<br>
The relevant differential equation has two parameters: the oscillation freq=
uency<br>
and damping factor.=C2=A0 The maximum oscillation frequency is the block ra=
te.=C2=A0 Any<br>
oscillation faster than the block rate cannot be measured by block times.=
=C2=A0 The<br>
damping rate is an exponential decay and for critical damping is twice the<=
br>
oscillation frequency.<br>
<br>
So, this is a zero parameter, optimal damping solution for a varying hashra=
te.<br>
This is inherently a numeric approximation solution to a differential equat=
ion,<br>
so questions of approximations for the hashrate enter, but that&#39;s all.=
=C2=A0 Weak<br>
block proposals will be able to get better approximations to the hashrate.<=
br>
<br>
If solving this problem is deemed desirable, I can put some time into this,=
 or<br>
direct others as to how to go about it.<br>
<br>
--<br>
Cheers, Bob McElrath<br>
<br>
&quot;For every complex problem, there is a solution that is simple, neat, =
and wrong.&quot;<br>
=C2=A0 =C2=A0 -- H. L. Mencken<br><br></blockquote></div></div></div>

--001a114123c6ad12b9052d939ae2--