[prev in list] [next in list] [prev in thread] [next in thread] 

List:       bitcoin-dev
Subject:    [bitcoin-dev] BIP suggestion: PoW proportional to block transaction sum
From:       Darren Weber via bitcoin-dev <bitcoin-dev () lists ! linuxfoundation ! org>
Date:       2018-05-30 16:17:29
Message-ID: CAJfMfCoK5=KVr6NB-dxddbjB+ufZxgaUBqwxN+_O3f9JWuut0w () mail ! gmail ! com
[Download RAW message or body]

[Attachment #2 (multipart/alternative)]


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

[Attachment #5 (text/html)]

<div dir="ltr"><div><br></div><div>Apologies for brevity, noob here and just 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 \
research).<br></div><div><br></div><div>From <a \
href="https://github.com/bitcoin/bitcoin/issues/13342">https://github.com/bitcoin/bitcoin/issues/13342</a></div><div><br></div><div>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 &quot;proportionality \
function&quot; 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).<br></div><div><br></div><div>If there is \
original value in the idea, I can try to make time to follow-up with a better BIP \
proposal.</div><div><br></div><div>-- <br><div \
class="gmail_signature">Darren<br><br></div> </div></div>



_______________________________________________
bitcoin-dev mailing list
bitcoin-dev@lists.linuxfoundation.org
https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev


[prev in list] [next in list] [prev in thread] [next in thread]