MIME-Version: 1.0
From: Darren Weber <dweber.consulting@gmail.com>
Date: Wed, 30 May 2018 09:17:29 -0700
Message-ID: <CAJfMfCoK5=KVr6NB-dxddbjB+ufZxgaUBqwxN+_O3f9JWuut0w@mail.gmail.com>
To: bitcoin-dev@lists.linuxfoundation.org
Content-Type: multipart/alternative; boundary="0000000000002f6701056d6eb10a"
Subject: [bitcoin-dev] BIP suggestion: PoW proportional to block transaction
	sum
Precedence: list

--0000000000002f6701056d6eb10a
Content-Type: text/plain; charset="UTF-8"

Apologies for brevity, noob here and just throwing out an idea in case it's
useful (probably already covered somewhere, but I haven't got time to do
all the necessary background research).

From https://github.com/bitcoin/bitcoin/issues/13342

Suggestion:  To make it more difficult for a malicious attacker to reap
quick rewards by double-spending large amounts with a relatively brief
majority of the network hashing power, introduce a hash workload that is
proportional to the sum of transactions in a block (probably the sum of the
absolute values, and a "proportionality function" could be linear or
exponential).  The motivation is to make it more difficult for malicious
attacks to hash-power their way through a few large transactions.
Obviously, there are costs in greater transaction delays (and fees?) for
larger amounts (absolute value).

If there is original value in the idea, I can try to make time to follow-up
with a better BIP proposal.

-- 
Darren

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

<div dir=3D"ltr"><div><br></div><div>Apologies for brevity, noob here and j=
ust throwing out an idea in case it&#39;s useful (probably already covered =
somewhere, but I haven&#39;t got time to do all the necessary background re=
search).<br></div><div><br></div><div>From <a href=3D"https://github.com/bi=
tcoin/bitcoin/issues/13342">https://github.com/bitcoin/bitcoin/issues/13342=
</a></div><div><br></div><div>Suggestion:=C2=A0 To make it more difficult f=
or a malicious attacker to reap quick rewards by double-spending large amou=
nts with a relatively brief majority of the network hashing power, introduc=
e a hash workload that is proportional to the sum of transactions in a bloc=
k (probably the sum of the absolute values, and a &quot;proportionality fun=
ction&quot; could be linear or exponential).=C2=A0 The motivation is to mak=
e it more difficult for malicious attacks to hash-power their way through a=
 few large transactions.=C2=A0 Obviously, there are costs in greater transa=
ction delays (and fees?) for larger amounts (absolute value).<br></div><div=
><br></div><div>If there is original value in the idea, I can try to make t=
ime to follow-up with a better BIP proposal.</div><div><br></div><div>-- <b=
r><div class=3D"gmail_signature">Darren<br><br></div>
</div></div>

--0000000000002f6701056d6eb10a--