path: root/02/f6bf70b2ed8896a5b8d381d1a61abe38fd4380

Return-Path: <thealanevans@gmail.com>
Received: from smtp1.linuxfoundation.org (smtp1.linux-foundation.org
	[172.17.192.35])
	by mail.linuxfoundation.org (Postfix) with ESMTPS id B83EDF99
	for <bitcoin-dev@lists.linuxfoundation.org>;
	Sat, 20 Jan 2018 14:46:46 +0000 (UTC)
X-Greylist: whitelisted by SQLgrey-1.7.6
Received: from mail-ot0-f170.google.com (mail-ot0-f170.google.com
	[74.125.82.170])
	by smtp1.linuxfoundation.org (Postfix) with ESMTPS id D7E15203
	for <bitcoin-dev@lists.linuxfoundation.org>;
	Sat, 20 Jan 2018 14:46:42 +0000 (UTC)
Received: by mail-ot0-f170.google.com with SMTP id x4so3898064otg.7
	for <bitcoin-dev@lists.linuxfoundation.org>;
	Sat, 20 Jan 2018 06:46:42 -0800 (PST)
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025;
	h=mime-version:in-reply-to:references:from:date:message-id:subject:to; 
	bh=lorqFFmN5xTskhqMZxQhrAyVp4FN0eGPmZKHmZgVajQ=;
	b=nckeoHMHF62MQtJ8toWZAZUrubrsz4PUgYN6RNTv/l2znyG1QdTikkaqsm63bAvnNq
	C+Tj4hN+wyxTL/tJyHlRr7cPbq4LUQRqYR2K4WEPm7bRnWcYoIYVWIxlgzG7TNov0prY
	fWIthFXmbcni/qJYk+rw+4uUAPubrvpLMXfQBnz3oFjT8zDnyT34lMBDHkkaw8twBJUI
	nAtU4GwAGX9Tmmc2uju8E3tm/3XxMSTnx2hzi9YMzmXDLxhOgC/Tl2wIeeYhubOh7pkm
	B3GUJRsBnjO0FOUGq+2johGVpmGPsL4Mld6qr2MIIukGnoewKpLmxA2lMftqco+Zc+Pz
	WFAQ==
X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed;
	d=1e100.net; s=20161025;
	h=x-gm-message-state:mime-version:in-reply-to:references:from:date
	:message-id:subject:to;
	bh=lorqFFmN5xTskhqMZxQhrAyVp4FN0eGPmZKHmZgVajQ=;
	b=dRSkbNB2mz5TYiw1L8NVW2zW/XgSDnDvuZVZTe9u4d0ye30cyrgu3HRRehxxrwHiBz
	68fSLhAxiPWH+SANneK9mNQZfpE6WO1syVrMXp9hIVZXzxx8ZFneO23daFeVMD8LqCGD
	rVv1zBDYKPjx/G0JRwZpS+kXBF72BChXsxsww6bMolTeLOrdfh/nwQ9DkGOyV1oHFboV
	Hd6NEhoE61KSzFhB63JMQKrwCTdoaFD1c/PhAGiZebRB0/mDWxMlCnUNY6rD2RHH97Wo
	Sqk7rH47nxhp/b+VBdDB3pQQW2YFYIBCz+DEus442Lvtc6fSBwTHAdrG9GShb5VqPoxb
	mmSw==
X-Gm-Message-State: AKwxytdMvvWQjKgBOem82RkRj8ISNtoutjUhgDxQes7IWiw21cnQzePt
	PyxkVGj6gtEjotpImnlbl5KYy1F0v+l9yXCechg=
X-Google-Smtp-Source: AH8x225onzfTjgu+CB3Xr73HYzhnn+3yTvNea2k4VXmIOI4A9EHrIVpkr49pQKAftcZUEmfAMqgiHn5UKcZPqmcYgg8=
X-Received: by 10.157.39.229 with SMTP id c92mr1014960otb.212.1516459601938;
	Sat, 20 Jan 2018 06:46:41 -0800 (PST)
MIME-Version: 1.0
Received: by 10.74.140.104 with HTTP; Sat, 20 Jan 2018 06:46:41 -0800 (PST)
In-Reply-To: <PS2P216MB0179B7D7EDAE4704836A91F09DEE0@PS2P216MB0179.KORP216.PROD.OUTLOOK.COM>
References: <PS2P216MB0179D103B5D93555D166E74F9D180@PS2P216MB0179.KORP216.PROD.OUTLOOK.COM>
	<PS2P216MB0179F13FF364666D92E6B2F89D1F0@PS2P216MB0179.KORP216.PROD.OUTLOOK.COM>
	<PS2P216MB0179436AF3183A14D79869D39DEF0@PS2P216MB0179.KORP216.PROD.OUTLOOK.COM>
	<PS2P216MB0179B7D7EDAE4704836A91F09DEE0@PS2P216MB0179.KORP216.PROD.OUTLOOK.COM>
From: Alan Evans <thealanevans@gmail.com>
Date: Sat, 20 Jan 2018 10:46:41 -0400
Message-ID: <CALPhJaw_kMp=M5ACi4DPVAXjR0ra9988ccMNPg3Zh9=f9EDBxA@mail.gmail.com>
To: Damian Williamson <willtech@live.com.au>, 
	Bitcoin Protocol Discussion <bitcoin-dev@lists.linuxfoundation.org>
Content-Type: multipart/alternative; boundary="94eb2c047078e3ceac0563364327"
X-Spam-Status: No, score=-2.0 required=5.0 tests=BAYES_00,DKIM_SIGNED,
	DKIM_VALID, DKIM_VALID_AU, FREEMAIL_FROM, HTML_MESSAGE,
	RCVD_IN_DNSWL_NONE autolearn=ham version=3.3.1
X-Spam-Checker-Version: SpamAssassin 3.3.1 (2010-03-16) on
	smtp1.linux-foundation.org
X-Mailman-Approved-At: Sat, 20 Jan 2018 14:54:06 +0000
Subject: Re: [bitcoin-dev] BIP Proposal: Revised: UTPFOTIB - Use Transaction
 Priority For Ordering Transactions In Blocks
X-BeenThere: bitcoin-dev@lists.linuxfoundation.org
X-Mailman-Version: 2.1.12
Precedence: list
List-Id: Bitcoin Protocol Discussion <bitcoin-dev.lists.linuxfoundation.org>
List-Unsubscribe: <https://lists.linuxfoundation.org/mailman/options/bitcoin-dev>,
	<mailto:bitcoin-dev-request@lists.linuxfoundation.org?subject=unsubscribe>
List-Archive: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/>
List-Post: <mailto:bitcoin-dev@lists.linuxfoundation.org>
List-Help: <mailto:bitcoin-dev-request@lists.linuxfoundation.org?subject=help>
List-Subscribe: <https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev>,
	<mailto:bitcoin-dev-request@lists.linuxfoundation.org?subject=subscribe>
X-List-Received-Date: Sat, 20 Jan 2018 14:46:46 -0000

--94eb2c047078e3ceac0563364327
Content-Type: text/plain; charset="UTF-8"

I don't see any modifications to the proposal that addresses the issue that
miners will always be free to choose their own priority that a few people
brought up before.

I understand you think it's in the miners best long-term interest to follow
these rules, but even if a miner agrees with you, if that miner thinks the
other miners are following the fee curve, they will know it makes no
overall difference if they cheat (you can't prove how long a miner has had
a transaction in their mempool).

The opportunity to cheat, the anonymity of mining, the low negative effect
of a single cheating instance, all combined with a financial incentive to
cheat means that cheating will be rife.


On Sat, Jan 20, 2018 at 8:04 AM, Damian Williamson via bitcoin-dev <
bitcoin-dev@lists.linuxfoundation.org> wrote:

> Tried a different approach for the curves, would appreciate it if someone
> has the energy to work on this and help me to resolve it a bit more
> scientifically:
>
>
> p(tx) = (((((fx - (fl - 0.00000001)) / (fh - (fl - 0.00000001))) * 100) +
> 1) ^ y) + (((((wx - 0.9) / ((86400 * n) - 0.9)) * 100) + 1) ^ y)
>
> p is the calculated priority number for tx the specific valid transaction.
> fx is the fee in BTC/KB for the specific transaction.
> fl is the lowest valid fee in BTC/KB currently in the nodes mempool.
> fh is the highest valid fee in BTC/KB currently in the nodes mempool.
> wx is the current wait in seconds for tx the specific valid transaction.
> n is the number of days maximum wait consensus value.
> y can be 10 or, y can be a further developed to be a formula based on the
> number of required inclusions to vary the steepness of the curve as the
> mempool size varies.
>
> In the next step, the random value must be:
> if random(101^y) < p then transaction is included;
>
> Regards,
> Damian Williamson
>
> ------------------------------
> *From:* Damian Williamson <willtech@live.com.au>
> *Sent:* Saturday, 20 January 2018 10:25:43 AM
> *To:* Bitcoin Protocol Discussion
> *Subject:* Re: [bitcoin-dev] BIP Proposal: Revised: UTPFOTIB - Use
> Transaction Priority For Ordering Transactions In Blocks
>
>
> An example curve:
>
> The curve curently described here is ineffective at acheiving the
> requirements. It seems to be not nearly steep enough resulting in too many
> inclusions (as it happens, this may not metter - needs further evaluation)
> and, the lower end values seem problematically small but, results in a
> number between 100 for the highest fee BTC/KB and a small fraction of 1 for
> the lowest. This math needs to be improved.
>
>
> pf(tx) = sin2((fx-(fl-0.00000001))/(fh-(fl-0.00000001))*1.
> 570796326795)*100
>
>
> pf is the calculated priority number for the fee for tx the specifc valid
> transaction.
> fx is the fee in BTC/KB for the specific transaction.
> fl is the lowest valid fee in BTC/KB currently in the nodes mempool.
> fh is the highest valid fee in BTC/KB currently in the nodes mempool.
>
> ------------------------------
> *From:* bitcoin-dev-bounces@lists.linuxfoundation.org <
> bitcoin-dev-bounces@lists.linuxfoundation.org> on behalf of Damian
> Williamson via bitcoin-dev <bitcoin-dev@lists.linuxfoundation.org>
> *Sent:* Thursday, 4 January 2018 8:01:10 PM
> *To:* Bitcoin Protocol Discussion
> *Subject:* [bitcoin-dev] BIP Proposal: Revised: UTPFOTIB - Use
> Transaction Priority For Ordering Transactions In Blocks
>
>
> This proposal has a new update, mostly minor edits. Additionally, I had a
> logic flaw in the hard fork / soft fork declaration statement. The specific
> terms of the CC-BY-SA-4.0 licence the document is published under have
> now been updated to include additional permissions available under the MIT
> licence.
>
>
> Recently, on Twitter:
>
> I am looking for a capable analyst/programmer to work on a BIP proposal as
> co-author. Will need to format several Full BIP's per these BIP process
> requirements: ( https://github.com/bitcoin/bips/blob/master/bip-0002.
> mediawiki ) from a BIP Proposal, being two initially for non-consensus
> full-interoperable pre-rollout on peer service layer & API/RPC layer and, a
> reference implementation for Bitcoin Core per: (
> https://github.com/bitcoin/bitcoin/blob/master/CONTRIBUTING.md ).
> Interested parties please reply via this list thread: (
> https://lists.linuxfoundation.org/pipermail/bitcoin-dev/
> 2017-December/015485.html ) #Bitcoin #BIP
>
>
> Regards,
>
> Damian Williamson
>
>
> ------------------------------
> *From:* bitcoin-dev-bounces@lists.linuxfoundation.org <
> bitcoin-dev-bounces@lists.linuxfoundation.org> on behalf of Damian
> Williamson via bitcoin-dev <bitcoin-dev@lists.linuxfoundation.org>
> *Sent:* Monday, 1 January 2018 10:04 PM
> *To:* bitcoin-dev@lists.linuxfoundation.org
> *Subject:* [bitcoin-dev] BIP Proposal: Revised: UTPFOTIB - Use
> Transaction Priority For Ordering Transactions In Blocks
>
> Happy New Year all.
>
> This proposal has been further amended with several minor changes and a
> few additions.
>
> I believe that all known issues raised so far have been sufficiently
> addressed. Either that or, I still have more work to do.
>
> ## BIP Proposal: Revised: UTPFOTIB - Use Transaction Priority For
> Ordering Transactions In Blocks
>
> Schema:
> ##########
> Document: BIP Proposal
> Title: UTPFOTIB - Use Transaction Priority For Ordering Transactions In
> Blocks
> Published: 26-12-2017
> Revised: 01-01-2018
> Author: Damian Williamson <willtech@live.com.au>
> Licence: Creative Commons Attribution-ShareAlike 4.0 International
> License.
> URL: http://thekingjameshrmh.tumblr.com/post/168948530950/bip-proposal-
> utpfotib-use-transaction-priority-for-order
> ##########
>
> ### 1. Abstract
>
> This document proposes to address the issue of transactional
> reliability in Bitcoin, where valid transactions may be stuck in the
> transaction pool for extended periods or never confirm.
>
> There are two key issues to be resolved to achieve this:
>
> 1.  The current transaction bandwidth limit.
> 2.  The current ad-hoc methods of including transactions in blocks
> resulting in variable and confusing confirmation times for valid
> transactions, including transactions with a valid fee that may never
> confirm.
>
> It is important with any change to protect the value of fees as these
> will eventually be the only payment that miners receive. Rather than an
> auction model for limited bandwidth, the proposal results in a fee for
> priority service auction model.
>
> It would not be true to suggest that all feedback received so far has
> been entirely positive although, most of it has been constructive.
>
> The previous threads for this proposal are available here:
> https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2017-December/s
> ubject.html
>
> In all parts of this proposal, references to a transaction, a valid
> transaction, a transaction with a valid fee, a valid fee, etc. is
> defined as any transaction that is otherwise valid with a fee of at
> least 0.00001000 BTC/KB as defined as the dust level, interpreting from
> Bitcoin Core GUI. Transactions with a fee lower than this rate are
> considered dust.
>
> In all parts of this proposal, dust and zero-fee transactions are
> always ignored and/or excluded unless specifically mentioned.
>
> It is generally assumed that miners currently prefer to include
> transactions with higher fees.
>
> ### 2. The need for this proposal
>
> We all must learn to admit that transaction bandwidth is still lurking
> as a serious issue for the operation, reliability, safety, consumer
> acceptance, uptake and, for the value of Bitcoin.
>
> I recently sent a payment which was not urgent so; I chose three-day
> target confirmation from the fee recommendation. That transaction has
> still not confirmed after now more than six days - even waiting twice
> as long seems quite reasonable to me (note for accuracy: it did
> eventually confirm). That transaction is a valid transaction; it is not
> rubbish, junk or, spam. Under the current model with transaction
> bandwidth limitation, the longer a transaction waits, the less likely
> it is ever to confirm due to rising transaction numbers and being
> pushed back by transactions with rising fees.
>
> I argue that no transactions with fees above the dust level are rubbish
> or junk, only some zero fee transactions might be spam. Having an ever-
> increasing number of valid transactions that do not confirm as more new
> transactions with higher fees are created is the opposite of operating
> a robust, reliable transaction system.
>
> While the miners have discovered a gold mine, it is the service they
> provide that is valuable. If the service is unreliable they are not
> worth the gold that they mine. This is reflected in the value of
> Bitcoin.
>
> Business cannot operate with a model where transactions may or may not
> confirm. Even a business choosing a modest fee has no guarantee that
> their valid transaction will not be shuffled down by new transactions
> to the realm of never confirming after it is created. Consumers also
> will not accept this model as Bitcoin expands. If Bitcoin cannot be a
> reliable payment system for confirmed transactions then consumers, by
> and large, will simply not accept the model once they understand.
> Bitcoin will be a dirty payment system, and this will kill the value of
> Bitcoin.
>
> Under the current system, a minority of transactions will eventually be
> the lucky few who have fees high enough to escape being pushed down the
> list.
>
> Once there are more than x transactions (transaction bandwidth limit)
> every ten minutes, only those choosing twenty-minute confirmation (2
> blocks) from the fee recommendations will have initially at most a
> fifty percent chance of ever having their payment confirm by the time
> 2x transactions is reached. Presently, not even using fee
> recommendations can ensure a sufficiently high fee is paid to ensure
> transaction confirmation.
>
> I also argue that the current auction model for limited transaction
> bandwidth is wrong, is not suitable for a reliable transaction system
> and, is wrong for Bitcoin. All transactions with valid fees must
> confirm in due time. Currently, Bitcoin is not a safe way to send
> payments.
>
> I do not believe that consumers and business are against paying fees,
> even high fees. What is required is operational reliability.
>
> This great issue needs to be resolved for the safety and reliability of
> Bitcoin. The time to resolve issues in commerce is before they become
> great big issues. The time to resolve this issue is now. We must have
> the foresight to identify and resolve problems before they trip us
> over.  Simply doubling block sizes every so often is reactionary and is
> not a reliable permanent solution.
>
> I have written this proposal for a technical solution but, need your
> help to write it up to an acceptable standard to be a full BIP.
>
> ### 3. The problem
>
> Everybody wants value. Miners want to maximise revenue from fees (and
> we presume, to minimise block size). Consumers need transaction
> reliability and, (we presume) want low fees.
>
> The current transaction bandwidth limit is a limiting factor for both.
> As the operational safety of transactions is limited, so is consumer
> confidence as they realise the issue and, accordingly, uptake is
> limited. Fees are artificially inflated due to bandwidth limitations
> while failing to provide a full confirmation service for all valid
> transactions.
>
> Current fee recommendations provide no satisfaction for transaction
> reliability and, as Bitcoin scales, this will worsen.
>
> Transactions are included in blocks by miners using whatever basis they
> prefer. We expect that this is usually a fee-based priority. However,
> even transactions with a valid fee may be left in the transaction pool
> for some time. As transaction bandwidth becomes an issue, not even
> extreme fees can ensure a transaction is processed in a timely manner
> or at all.
>
> Bitcoin must be a fully scalable and reliable service, providing full
> transaction confirmation for every valid transaction.
>
> The possibility to send a transaction with a fee lower than one that is
> acceptable to allow eventual transaction confirmation should be removed
> from the protocol and also from the user interface.
>
> Bitcoin should be capable of reliably and inexpensively processing
> casual transactions, and also priority processing of fee paying at
> auction for priority transactions in the shortest possible timeframe.
>
> ### 4. Solution summary
>
> #### Main solution
>
> Provide each valid transaction in the mempool with an individual
> transaction priority each time before choosing transactions to include
> in the current block. The priority being a function of the fee (on a
> curve), and the time waiting in the transaction pool (also on a curve)
> out to n days (n = 60 days ?), and extending past n days. The value for
> fee on a curve may need an upper limit. The transaction priority to
> serve as the likelihood of a transaction being included in the current
> block, and for determining the order in which transactions are tried to
> see if they will be included.
>
> Nodes will need to keep track of when a transaction is first seen. It
> is satisfactory for each node to do this independently provided the
> full mempool and information survives node restart. If there is a more
> reliable way to determine when a transaction was first seen on the
> network then it should be utilised.
>
> > My current default installation of Bitcoin Core v0.15.1 does not
> currently seem to save and load the mempool on restart, despite the
> notes in the command line options panel that the default for
> persistmempool is 1. In the debug panel, some 90,000 transactions
> before restart, some 200 odd shortly after. Manually setting
> persistmempool=1 in the conf file does not seem to make any difference.
> Perhaps it is operating as expected and I am not sure what to observe,
> but does not seem to be observably saving and loading the mempool on
> restart. This will need to be resolved.
>
> Use a dynamic target block size to make the current block. This marks a
> shift from using block size or weight to a count of transactions.
> Determine the target block size using; pre-rollout(current average
> valid transaction pool size) x ( 1 / (144 x n days ) ) = number of
> transactions to be included in the current block. The block created
> should be a minimum 1MB in size regardless if the target block size is
> lower.
>
> If the created block size consistently contains too few transactions
> and the number of new transactions created is continuously greater than
> the block size will accommodate then I expect eventually ageing
> transactions will be over-represented as a portion of the block
> contents. Once another new node conforming to the proposal makes a
> block, the block size will be proportionately larger as the transaction
> pool has grown.  If block size is too large on average then this will
> shrink the transaction pool.
>
> Miners will likely want to conform to the proposal, since making blocks
> larger than necessary makes more room in each block potentially
> lowering the highest fees paid for priority service. Always making
> blocks smaller than the proposal requires will in time lower the
> utility value of Bitcoin, a different situation but akin to the
> current. Transactions will still always confirm but with longer and
> longer wait periods. The auction at the front of the queue for priority
> will be destroyed as there will be eventually no room in blocks besides
> ageing transations and, there will be little value paying higher than
> the minimum fee. Obviously, neither of these scenarios are in a miner's
> interests.
>
> Without a consensus as to what size dynamic block to create,
> enforcement of dynamic block size is not currently possible. It may be
> possible for a consensus to be formed in the future but here I cannot
> speculate. I can only suggest that it is in the interest of Bitcoin as
> a whole and, in the interest of each node to conform to the proposal.
> Some nodes failing to conform to the proposed requirements of dynamic
> size or transaction priority in this proposal will not be destructive
> to the operation of the proposal.
>
> If necessary, nodes that have not yet adopted the proposal will just
> continue to create standard fixed size unordered blocks, although, if
> the current mechanisms of block validation include the fixed block size
> then it is unlikely that these nodes will be able to validate the
> blockchain going forward. In this case a hard fork and a full transfer
> to the new method should be required. If dynamic blocks with ordered
> transactions will be valid to existing nodes then only a soft fork is
> required. There is no proposed change to the internal construction of
> blocks, only to the block size and using an ordered method of
> transaction selection.
>
> > The default value for mempoolexpiry in Bitcoin Core may in future
> need to be adjusted to match something more than n days or, perhaps
> using less than n = 14 days may be a more sensible approach?
>
> All block created with dynamic size should be verified to ensure
> conformity to a probability distribution curve resulting from the
> priority method. Since the input is a probability, the output should
> conform to a probability distribution.
>
> The curves used for the priority of transactions would have to be
> appropriate. Perhaps a mathematician with experience in probability can
> develop the right formulae. My thinking is a steep curve. I suppose
> that the probability of all transactions should probably account for a
> sufficient number of inclusions that the target block size is met on
> average although, it may not always be. As a suggestion, consider
> including some dust or zero-fee transactions to pad if each valid
> transaction is tried and the target block size is not yet met, highest
> BTC transaction value first?
>
> **Explanation of the operation of priority:**
>
> > If transaction priority is, for example, a number between one (low)
> and one-hundred (high) it can be directly understood as the percentage
> chance in one-hundred of a transaction being included in the block.
> Using probability or likelihood infers that there is some function of
> random. Try the transactions in priority order from highest to lowest,
> if random (100) < transaction priority then the transaction is included
> until the target block size is met.
>
> > To break it down further, if both the fee on a curve value and the
> time waiting on a curve value are each a number between one and one-
> hundred, a rudimentary method may be to simply multiply those two
> numbers, to find the priority number. For example, a middle fee
> transaction waiting thirty days (if n = 60 days) may have a value of
> five for each part  (yes, just five, the values are on a curve). When
> multiplied that will give a priority value of twenty-five, or, a
> twenty-five percent chance at that moment of being included in the
> block; it will likely be included in one of the next four blocks,
> getting more likely each chance. If it is still not included then the
> value of time waiting will be higher, making for more probability. A
> very low fee transaction would have a value for the fee of one. It
> would not be until near sixty-days that the particular low fee
> transaction has a high likelihood of being included in the block.
>
> In practice it may be more useful to use numbers representative of one-
> hundred for the highest fee priority curve down to a small fraction of
> one for the lowest fee and, from one for a newly seen transaction up to
> a proportionately high number above one-hundred for the time waiting
> curve. It is truely beyond my level of math to resolve probability
> curves accurately without much trial and error.
>
> The primary reason for addressing the issue is to ensure transactional
> reliability and scalability while having each valid transaction confirm
> in due time.
>
> #### Pros
>
> *   Maximizes transaction reliability.
> *   Overcomes transaction bandwidth limit.
> *   Fully scalable.
> *   Maximizes possibility for consumer and business uptake.
> *   Maximizes total fees paid per block without reducing reliability;
> because of reliability, in time confidence and overall uptake are
> greater; therefore, more transactions.
> *   Market determines fee paid for transaction priority.
> *   Fee recommendations work all the way out to 30 days or greater.
> *   Provides additional block entropy; greater security since there is
> less probability of predicting the next block. _Although this is not
> necessary it is a product of the operation of this proposal._
>
> #### Cons
>
> *   Could initially lower total transaction fees per block.
> *   Must be first be programmed.
>
> #### Pre-rollout
>
> Nodes need to have at a minimum a loose understanding of the average
> (since there is no consensus) size of the transaction pool as a
> requirement to enable future changes to the way blocks are constructed.
>
> A new network service should be constructed to meet this need. This
> service makes no changes to any existing operation or function of the
> node. Initially, Bitcoin Core is a suitable candidate.
>
> For all operations we count only valid transactions.
>
> **The service must:**
>
> *   Have an individual temporary (runtime permanent only) Serial Node
> ID.
> *   Accept communication of the number of valid transactions in the
> mempool of another valid Bitcoin node along with the Serial Node ID of
> the node whose value is provided.
> *   Disconnect the service from any non-Bitcoin node. Bitcoin Core may
> handle this already?
> *   Expire any value not updated for k minutes (k = 30 minutes?).
> *   Broadcast all mempool information the node has every m minutes (m =
> 10 minutes?), including its own.
> *   Nodes own mempool information should not be broadcast or used in
> calculation until the node has been up long enough for the mempool to
> normalise for at least o minutes (o = 300 minutes ?)
> *   Alternatively, if loading nodes own full mempool from disk on node
> restart (o = 30 minutes ?)
> *   Only new or updated mempool values should be transmitted to the
> same node. Updated includes updated with no change.
> *   All known mempool information must survive node restart.
> *   If the nodes own mempool is not normalised and network information
> is not available to calculate an average just display zero.
> *   Internally, the average transaction pool size must return the
> calculated average if an average is available or, if none is available
> just the number of valid transactions in the node's own mempool
> regardless if it is normalised.
>
> Bitcoin Core must use all collated information on mempool size to
> calculate a figure for the average mempool size.
>
> The calculated figure should be displayed in the appropriate place in
> the Debug window alongside the text Network average transactions.
>
> Consideration must be given before development of the network bandwidth
> this would require. All programming must be consistent with the current
> operation and conventions of Bitcoin Core. Methods must work on all
> platforms.
>
> As this new service does not affect any existing service or feature of
> Bitcoin or Bitcoin Core, this can technically be programmed now and
> included in Bitcoin Core at any time.
>
> ### 5. Solution operation
>
> This is a simplistic view of the operation. The actual operation will
> need to be determined accurately in a spec for the programmer.
>
> 1.  Determine the target block size for the current block.
> 2.  Assign a transaction priority to each valid transaction in the
> mempool.
> 3.  Select transactions to include in the current block using
> probability in transaction priority order until the target block size
> is met. If target block size is not met, include dust and zero-fee
> transactions to pad.
> 4.  Solve block.
> 5.  Broadcast the current block when it is solved.
> 6.  Block is received.
> 7.  Block verification process.
> 8.  Accept/reject block based on verification result.
> 9.  Repeat.
>
> ### 6. Closing comments
>
> It may be possible to verify blocks conform to the proposal by showing
> that the probability for all transactions included in the block
> statistically conforms to a probability distribution curve, *if* the
> individual transaction priority can be recreated. I am not that deep
> into the mathematics; however, it may also be possible to use a similar
> method to do this just based on the fee, that statistically, the block
> conforms to a fee distribution. Any dust and zero-fee transactions
> would have to be ignored. This solution needs a competent mathematician
> with experience in probability and statistical distribution.
>
> It is trivial to this proposal to offer that a node provides the next
> block size with a block when it is solved. I am not sure that this
> creates any actual benefit since the provided next block size is only
> one node's view, as it is the node may seemingly just as well use its
> own view and create the block. Providing a next block size only adds
> additional complexity to the required operation, however, perhaps
> providing the next block size is not trivial in what is accomplished
> and the feature can be included in the operation.
>
> Instead of the pre-rollout network service providing data as to valid
> transactions in mempool, it could directly provide data as to the
> suggested next block size if that is preferred, using a similar
> operation as is suggested now and averaging all received suggested next
> block sizes.
>
> It may be foreseeable in the future for Bitcoin to operate with a
> network of dedicated full blockchain & mempool servers. This would not
> be without challenges to overcome but would offer several benefits,
> including to the operation of this proposal, and especially as the RAM
> and storage requirements of a full node grows. It is easy to foresee
> that in just another seven years of operation a Bitcoin Full Node will
> require at least 300GB of storage and, if the mempool only doubles in
> size, over 1GB of RAM.
>
> There has been some concern expressed over spam and very low fee
> transactions, and an infinite block size resulting. I hope that for
> those concerned using the dust level addresses the issue, especially as
> the value of Bitcoin grows.
>
> Notwithstanding this proposal, all blocks including those with dynamic
> size each have limited transaction space per block. This proposal
> results in a fee for priority service auction, where the probability of
> a transaction to be included in limited space in the next available
> block is auctioned to the highest bidders and all other transactions
> must wait until they reach priority by ageing to gain significant
> probability. Under this proposal the mempool can grow quite large while
> the confirmation service continues in a stable and reliable manner.
> Several incentives for attackers are removed, where there is no longer
> multiple potential incentives for unnecessarily filling blocks or
> flooding the mempool with transactions, whether such transactions are
> fraudulent, valid or, otherwise. Adoption of this proposal and
> adherence results in a reliable, stable fee paying transaction
> confirmation service and a beneficial auction.
>
> This proposal is necessary. I implore, at the very least, that we use
> some method that validates full transaction reliability and enables
> scalability of Bitcoin. If not this proposal, an alternative.
>
> I have done as much with this proposal as I feel that I am able so far
> but continue to take your feedback.
>
> Regards,
> Damian Williamson
>
> [![Creative Commons License](https://i.creativecommons.org/l/by-sa/4.0/
> 88x31.png)](http://creativecommons.org/licenses/by-sa/4.0/)
> <span xmlns:dct="http://purl.org/dc/terms/"
> href="http://purl.org/dc/dcmitype/Text" property="dct:title"
> rel="dct:type">BIP Proposal: UTPFOTIB - Use Transaction Priority For
> Ordering Transactions In Blocks</span> by [Damian Williamson
> &lt;willtech@live.com.au&gt;](http://thekingjameshrmh.tumblr.com/post/1
> 68948530950/bip-proposal-utpfotib-use-transaction-priority-for-order)
> is licensed under a [Creative Commons Attribution-ShareAlike 4.0
> International License](http://creativecommons.org/licenses/by-sa/4.0/).
> Based on a work at https://lists.linuxfoundation.org/pipermail/bitcoin-
> dev/2017-
> December/015371.html](https://lists.linuxfoundation.org/pipermail/bitco
> in-dev/2017-December/015371.html).
> Permissions beyond the scope of this license may be available at [https
> ://opensource.org/licenses/BSD-3-
> Clause](https://opensource.org/licenses/BSD-3-Clause).
>
>
> _______________________________________________
> bitcoin-dev mailing list
> bitcoin-dev@lists.linuxfoundation.org
> https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev
>
> _______________________________________________
> bitcoin-dev mailing list
> bitcoin-dev@lists.linuxfoundation.org
> https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev
>
>

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

<div dir=3D"ltr">I don&#39;t see any modifications to the proposal that add=
resses the issue that miners will always be free to choose their own priori=
ty that a few people brought up before.<div><br></div><div>I understand you=
 think it&#39;s in the miners best long-term interest to follow these rules=
, but even if a miner agrees with you, if that miner thinks the other miner=
s are following the fee curve, they will know it makes no overall differenc=
e if they cheat (you can&#39;t prove=C2=A0how long a miner has had a transa=
ction in their mempool).</div><div><br></div><div>The opportunity=C2=A0to c=
heat, the=C2=A0anonymity of mining, the low negative effect of a single che=
ating instance, all combined with a financial incentive to cheat means that=
 cheating will be rife.</div><div><br></div></div><div class=3D"gmail_extra=
"><br><div class=3D"gmail_quote">On Sat, Jan 20, 2018 at 8:04 AM, Damian Wi=
lliamson via bitcoin-dev <span dir=3D"ltr">&lt;<a href=3D"mailto:bitcoin-de=
v@lists.linuxfoundation.org" target=3D"_blank">bitcoin-dev@lists.linuxfound=
ation.org</a>&gt;</span> wrote:<br><blockquote class=3D"gmail_quote" style=
=3D"margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">




<div dir=3D"ltr">
<div id=3D"m_-5139946211365216398divtagdefaultwrapper" style=3D"font-size:1=
2pt;color:#000000;font-family:Calibri,Helvetica,sans-serif" dir=3D"ltr">
<p style=3D"margin-top:0;margin-bottom:0"><font size=3D"3" face=3D"Calibri,=
Helvetica,sans-serif" color=3D"black"><span style=3D"font-size:12pt" id=3D"=
m_-5139946211365216398divtagdefaultwrapper"></span></font></p>
<div style=3D"margin-top:0;margin-bottom:0">Tried a different approach for =
the curves, would appreciate it if someone has the energy to work on this a=
nd help me to resolve it a bit more scientifically:</div>
<font size=3D"3" face=3D"Calibri,Helvetica,sans-serif" color=3D"black"><spa=
n style=3D"font-size:12pt" id=3D"m_-5139946211365216398divtagdefaultwrapper=
">
<div style=3D"margin-top:0;margin-bottom:0"><br>
</div>
<div style=3D"margin-top:0;margin-bottom:0">=C2=A0</div>
<div style=3D"display:block">
<div>
<div style=3D"margin-top:0;margin-bottom:0">p(t<font size=3D"-1"><sub>x</su=
b></font>) =3D (((((f<font size=3D"-1"><sub>x</sub></font> - (f<font size=
=3D"-1"><sub>l</sub></font> - 0.00000001)) / (f<font size=3D"-1"><sub>h</su=
b></font> - (f<font size=3D"-1"><sub>l</sub></font>
 - 0.00000001))) * 100) + 1) ^ y) + (((((w<font size=3D"-1"><sub>x</sub></f=
ont> - 0.9) / ((86400 * n) - 0.9)) * 100) + 1) ^ y)</div>
<div style=3D"margin-top:0;margin-bottom:0"><br>
</div>
<div style=3D"margin-top:0;margin-bottom:0">p is the calculated priority nu=
mber for t<font size=3D"-1"><sub>x</sub></font> the specific valid transact=
ion.<span class=3D""><br>
f<font size=3D"-1"><sub>x</sub></font> is the fee in BTC/KB for the specifi=
c transaction.<br>
f<font size=3D"-1"><sub>l</sub></font> is the lowest valid fee in BTC/KB cu=
rrently in the nodes mempool.<br>
f<font size=3D"-1"><sub>h</sub></font> is the highest valid fee in BTC/KB c=
urrently in the nodes mempool.<br></span>
w<font size=3D"-1"><sub>x</sub></font> is the current wait in seconds for t=
<font size=3D"-1"><sub>x</sub></font> the specific valid transaction.<br>
n is the number of days maximum wait consensus value.<br>
y can be 10 or, y can be a further developed to be a formula based on the n=
umber of required inclusions to vary the steepness of the curve as the memp=
ool size varies.</div>
<div style=3D"margin-top:0;margin-bottom:0"><br>
</div>
<div style=3D"margin-top:0;margin-bottom:0">In the next step, the random va=
lue must be:<br>
if random(101^y) &lt; p then transaction is included;<br>
<br>
Regards,<br>
Damian Williamson<br>
</div>
</div>
</div>
</span></font><br>
<p></p>
</div>
<hr style=3D"display:inline-block;width:98%">
<div id=3D"m_-5139946211365216398divRplyFwdMsg" dir=3D"ltr"><font face=3D"C=
alibri, sans-serif" style=3D"font-size:11pt" color=3D"#000000"><b>From:</b>=
 Damian Williamson &lt;<a href=3D"mailto:willtech@live.com.au" target=3D"_b=
lank">willtech@live.com.au</a>&gt;<br>
<b>Sent:</b> Saturday, 20 January 2018 10:25:43 AM<br>
<b>To:</b> Bitcoin Protocol Discussion<br>
<b>Subject:</b> Re: [bitcoin-dev] BIP Proposal: Revised: UTPFOTIB - Use Tra=
nsaction Priority For Ordering Transactions In Blocks</font>
<div>=C2=A0</div>
</div><div><div class=3D"h5">

<div dir=3D"ltr">
<div id=3D"m_-5139946211365216398x_divtagdefaultwrapper" dir=3D"ltr" style=
=3D"font-size:12pt;color:#000000;font-family:Calibri,Helvetica,sans-serif">
<p>An example curve:<br>
<b></b></p>
<blockquote>
<p>The curve curently described here is ineffective at acheiving the requir=
ements. It seems to be not nearly steep enough resulting in too many inclus=
ions (as it happens, this may not metter - needs further evaluation) and, t=
he lower end values seem problematically
 small but, results in a number between 100 for the highest fee BTC/KB and =
a small fraction of 1 for the lowest. This math needs to be improved.</p>
<p><br>
</p>
<p>p<sub>f</sub>(t<sub>x</sub>) =3D sin<sup>2</sup>((f<sub>x</sub>-(f<sub>l=
</sub>-0.00000001))/(f<sub>h</sub>-<wbr>(f<sub>l</sub>-0.00000001))*1.<wbr>=
570796326795)*100</p>
<p><br>
</p>
<p>p<sub>f</sub> is the calculated priority number for the fee for t<sub>x<=
/sub> the specifc valid transaction.<br>
f<sub>x</sub> is the fee in BTC/KB for the specific transaction.<br>
f<sub>l</sub> is the lowest valid fee in BTC/KB currently in the nodes memp=
ool.<br>
f<sub>h</sub> is the highest valid fee in BTC/KB currently in the nodes mem=
pool.</p>
</blockquote>
</div>
<hr style=3D"display:inline-block;width:98%">
<div id=3D"m_-5139946211365216398x_divRplyFwdMsg" dir=3D"ltr"><font face=3D=
"Calibri, sans-serif" color=3D"#000000" style=3D"font-size:11pt"><b>From:</=
b> <a href=3D"mailto:bitcoin-dev-bounces@lists.linuxfoundation.org" target=
=3D"_blank">bitcoin-dev-bounces@lists.<wbr>linuxfoundation.org</a> &lt;<a h=
ref=3D"mailto:bitcoin-dev-bounces@lists.linuxfoundation.org" target=3D"_bla=
nk">bitcoin-dev-bounces@lists.<wbr>linuxfoundation.org</a>&gt; on behalf of=
 Damian Williamson via bitcoin-dev
 &lt;<a href=3D"mailto:bitcoin-dev@lists.linuxfoundation.org" target=3D"_bl=
ank">bitcoin-dev@lists.<wbr>linuxfoundation.org</a>&gt;<br>
<b>Sent:</b> Thursday, 4 January 2018 8:01:10 PM<br>
<b>To:</b> Bitcoin Protocol Discussion<br>
<b>Subject:</b> [bitcoin-dev] BIP Proposal: Revised: UTPFOTIB - Use Transac=
tion Priority For Ordering Transactions In Blocks</font>
<div>=C2=A0</div>
</div>

<div dir=3D"ltr">
<div id=3D"m_-5139946211365216398x_x_divtagdefaultwrapper" dir=3D"ltr" styl=
e=3D"font-size:12pt;color:rgb(0,0,0);font-family:Calibri,Helvetica,sans-ser=
if,&quot;EmojiFont&quot;,&quot;Apple Color Emoji&quot;,&quot;Segoe UI Emoji=
&quot;,NotoColorEmoji,&quot;Segoe UI Symbol&quot;,&quot;Android Emoji&quot;=
,EmojiSymbols">
<p style=3D"margin-top:0;margin-bottom:0">This proposal has a new update, m=
ostly minor edits. Additionally, I had a logic flaw in the hard fork / soft=
 fork declaration statement. The specific terms of the
<span>CC-BY-SA-4.0</span> licence the document is published under have now =
been updated to include additional permissions available under the MIT lice=
nce.</p>
<p style=3D"margin-top:0;margin-bottom:0"><br>
</p>
<p style=3D"margin-top:0;margin-bottom:0">Recently, on Twitter:</p>
<p style=3D"margin-top:0;margin-bottom:0">I am looking for a capable analys=
t/programmer to work on a BIP proposal as co-author. Will need to format se=
veral Full BIP&#39;s per these BIP process requirements: ( <a href=3D"https=
://github.com/bitcoin/bips/blob/master/bip-0002.mediawiki" target=3D"_blank=
">https://github.com/bitcoin/<wbr>bips/blob/master/bip-0002.<wbr>mediawiki<=
/a>
 ) from a BIP Proposal, being two initially for non-consensus full-interope=
rable pre-rollout on peer service layer &amp; API/RPC layer and, a referenc=
e implementation for Bitcoin Core per: ( <a href=3D"https://github.com/bitc=
oin/bitcoin/blob/master/CONTRIBUTING.md" target=3D"_blank">https://github.c=
om/bitcoin/<wbr>bitcoin/blob/master/<wbr>CONTRIBUTING.md</a> ). Interested
 parties please reply via this list thread: ( <a href=3D"https://lists.linu=
xfoundation.org/pipermail/bitcoin-dev/2017-December/015485.html" target=3D"=
_blank">https://lists.linuxfoundation.<wbr>org/pipermail/bitcoin-dev/<wbr>2=
017-December/015485.html</a> ) #Bitcoin #BIP</p>
<p style=3D"margin-top:0;margin-bottom:0"><br>
</p>
<p style=3D"margin-top:0;margin-bottom:0">Regards,</p>
<p style=3D"margin-top:0;margin-bottom:0">Damian Williamson<br>
</p>
<br>
<br>
<div style=3D"color:rgb(0,0,0)">
<hr style=3D"display:inline-block;width:98%">
<div id=3D"m_-5139946211365216398x_x_divRplyFwdMsg" dir=3D"ltr"><font face=
=3D"Calibri, sans-serif" color=3D"#000000" style=3D"font-size:11pt"><b>From=
:</b> <a href=3D"mailto:bitcoin-dev-bounces@lists.linuxfoundation.org" targ=
et=3D"_blank">bitcoin-dev-bounces@lists.<wbr>linuxfoundation.org</a> &lt;<a=
 href=3D"mailto:bitcoin-dev-bounces@lists.linuxfoundation.org" target=3D"_b=
lank">bitcoin-dev-bounces@lists.<wbr>linuxfoundation.org</a>&gt; on behalf =
of Damian Williamson via bitcoin-dev
 &lt;<a href=3D"mailto:bitcoin-dev@lists.linuxfoundation.org" target=3D"_bl=
ank">bitcoin-dev@lists.<wbr>linuxfoundation.org</a>&gt;<br>
<b>Sent:</b> Monday, 1 January 2018 10:04 PM<br>
<b>To:</b> <a href=3D"mailto:bitcoin-dev@lists.linuxfoundation.org" target=
=3D"_blank">bitcoin-dev@lists.<wbr>linuxfoundation.org</a><br>
<b>Subject:</b> [bitcoin-dev] BIP Proposal: Revised: UTPFOTIB - Use Transac=
tion Priority For Ordering Transactions In Blocks</font>
<div>=C2=A0</div>
</div>
<div class=3D"m_-5139946211365216398x_x_BodyFragment"><font size=3D"2"><spa=
n style=3D"font-size:11pt">
<div class=3D"m_-5139946211365216398x_x_PlainText">Happy New Year all.<br>
<br>
This proposal has been further amended with several minor changes and a<br>
few additions.<br>
<br>
I believe that all known issues raised so far have been sufficiently<br>
addressed. Either that or, I still have more work to do.<br>
<br>
## BIP Proposal: Revised: UTPFOTIB - Use Transaction Priority For<br>
Ordering Transactions In Blocks<br>
<br>
Schema: =C2=A0<br>
########## =C2=A0<br>
Document: BIP Proposal =C2=A0<br>
Title: UTPFOTIB - Use Transaction Priority For Ordering Transactions In<br>
Blocks =C2=A0<br>
Published: 26-12-2017 =C2=A0<br>
Revised: 01-01-2018 =C2=A0<br>
Author: Damian Williamson &lt;<a href=3D"mailto:willtech@live.com.au" targe=
t=3D"_blank">willtech@live.com.au</a>&gt;=C2=A0=C2=A0<br>
Licence: Creative Commons Attribution-ShareAlike 4.0 International<br>
License. =C2=A0<br>
URL: <a href=3D"http://thekingjameshrmh.tumblr.com/post/168948530950/bip-pr=
oposal-" id=3D"m_-5139946211365216398LPlnk655165" target=3D"_blank">
http://thekingjameshrmh.<wbr>tumblr.com/post/168948530950/<wbr>bip-proposal=
-</a><br>
utpfotib-use-transaction-<wbr>priority-for-order=C2=A0=C2=A0<br>
##########<br>
<br>
### 1. Abstract<br>
<br>
This document proposes to address the issue of transactional<br>
reliability in Bitcoin, where valid transactions may be stuck in the<br>
transaction pool for extended periods or never confirm.<br>
<br>
There are two key issues to be resolved to achieve this:<br>
<br>
1.=C2=A0=C2=A0The current transaction bandwidth limit.<br>
2.=C2=A0=C2=A0The current ad-hoc methods of including transactions in block=
s<br>
resulting in variable and confusing confirmation times for valid<br>
transactions, including transactions with a valid fee that may never<br>
confirm.<br>
<br>
It is important with any change to protect the value of fees as these<br>
will eventually be the only payment that miners receive. Rather than an<br>
auction model for limited bandwidth, the proposal results in a fee for<br>
priority service auction model.<br>
<br>
It would not be true to suggest that all feedback received so far has<br>
been entirely positive although, most of it has been constructive.<br>
<br>
The previous threads for this proposal are available here: =C2=A0<br>
<a href=3D"https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2017-Dec=
ember/s" id=3D"m_-5139946211365216398LPlnk453598" target=3D"_blank">https:/=
/lists.linuxfoundation.<wbr>org/pipermail/bitcoin-dev/<wbr>2017-December/s<=
/a><br>
ubject.html<br>
<br>
In all parts of this proposal, references to a transaction, a valid<br>
transaction, a transaction with a valid fee, a valid fee, etc. is<br>
defined as any transaction that is otherwise valid with a fee of at<br>
least 0.00001000 BTC/KB as defined as the dust level, interpreting from<br>
Bitcoin Core GUI. Transactions with a fee lower than this rate are<br>
considered dust.<br>
<br>
In all parts of this proposal, dust and zero-fee transactions are<br>
always ignored and/or excluded unless specifically mentioned.<br>
<br>
It is generally assumed that miners currently prefer to include<br>
transactions with higher fees.<br>
<br>
### 2. The need for this proposal<br>
<br>
We all must learn to admit that transaction bandwidth is still lurking<br>
as a serious issue for the operation, reliability, safety, consumer<br>
acceptance, uptake and, for the value of Bitcoin.<br>
<br>
I recently sent a payment which was not urgent so; I chose three-day<br>
target confirmation from the fee recommendation. That transaction has<br>
still not confirmed after now more than six days - even waiting twice<br>
as long seems quite reasonable to me (note for accuracy: it did<br>
eventually confirm). That transaction is a valid transaction; it is not<br>
rubbish, junk or, spam. Under the current model with transaction<br>
bandwidth limitation, the longer a transaction waits, the less likely<br>
it is ever to confirm due to rising transaction numbers and being<br>
pushed back by transactions with rising fees.<br>
<br>
I argue that no transactions with fees above the dust level are rubbish<br>
or junk, only some zero fee transactions might be spam. Having an ever-<br>
increasing number of valid transactions that do not confirm as more new<br>
transactions with higher fees are created is the opposite of operating<br>
a robust, reliable transaction system.<br>
<br>
While the miners have discovered a gold mine, it is the service they<br>
provide that is valuable. If the service is unreliable they are not<br>
worth the gold that they mine. This is reflected in the value of<br>
Bitcoin.<br>
<br>
Business cannot operate with a model where transactions may or may not<br>
confirm. Even a business choosing a modest fee has no guarantee that<br>
their valid transaction will not be shuffled down by new transactions<br>
to the realm of never confirming after it is created. Consumers also<br>
will not accept this model as Bitcoin expands. If Bitcoin cannot be a<br>
reliable payment system for confirmed transactions then consumers, by<br>
and large, will simply not accept the model once they understand.<br>
Bitcoin will be a dirty payment system, and this will kill the value of<br>
Bitcoin.<br>
<br>
Under the current system, a minority of transactions will eventually be<br>
the lucky few who have fees high enough to escape being pushed down the<br>
list.<br>
<br>
Once there are more than x transactions (transaction bandwidth limit)<br>
every ten minutes, only those choosing twenty-minute confirmation (2<br>
blocks) from the fee recommendations will have initially at most a<br>
fifty percent chance of ever having their payment confirm by the time<br>
2x transactions is reached. Presently, not even using fee<br>
recommendations can ensure a sufficiently high fee is paid to ensure<br>
transaction confirmation.<br>
<br>
I also argue that the current auction model for limited transaction<br>
bandwidth is wrong, is not suitable for a reliable transaction system<br>
and, is wrong for Bitcoin. All transactions with valid fees must<br>
confirm in due time. Currently, Bitcoin is not a safe way to send<br>
payments.<br>
<br>
I do not believe that consumers and business are against paying fees,<br>
even high fees. What is required is operational reliability.<br>
<br>
This great issue needs to be resolved for the safety and reliability of<br>
Bitcoin. The time to resolve issues in commerce is before they become<br>
great big issues. The time to resolve this issue is now. We must have<br>
the foresight to identify and resolve problems before they trip us<br>
over.=C2=A0=C2=A0Simply doubling block sizes every so often is reactionary =
and is<br>
not a reliable permanent solution.<br>
<br>
I have written this proposal for a technical solution but, need your<br>
help to write it up to an acceptable standard to be a full BIP.<br>
<br>
### 3. The problem<br>
<br>
Everybody wants value. Miners want to maximise revenue from fees (and<br>
we presume, to minimise block size). Consumers need transaction<br>
reliability and, (we presume) want low fees.<br>
<br>
The current transaction bandwidth limit is a limiting factor for both.<br>
As the operational safety of transactions is limited, so is consumer<br>
confidence as they realise the issue and, accordingly, uptake is<br>
limited. Fees are artificially inflated due to bandwidth limitations<br>
while failing to provide a full confirmation service for all valid<br>
transactions.<br>
<br>
Current fee recommendations provide no satisfaction for transaction<br>
reliability and, as Bitcoin scales, this will worsen.<br>
<br>
Transactions are included in blocks by miners using whatever basis they<br>
prefer. We expect that this is usually a fee-based priority. However,<br>
even transactions with a valid fee may be left in the transaction pool<br>
for some time. As transaction bandwidth becomes an issue, not even<br>
extreme fees can ensure a transaction is processed in a timely manner<br>
or at all.<br>
<br>
Bitcoin must be a fully scalable and reliable service, providing full<br>
transaction confirmation for every valid transaction.<br>
<br>
The possibility to send a transaction with a fee lower than one that is<br>
acceptable to allow eventual transaction confirmation should be removed<br>
from the protocol and also from the user interface.<br>
<br>
Bitcoin should be capable of reliably and inexpensively processing<br>
casual transactions, and also priority processing of fee paying at<br>
auction for priority transactions in the shortest possible timeframe.<br>
<br>
### 4. Solution summary<br>
<br>
#### Main solution<br>
<br>
Provide each valid transaction in the mempool with an individual<br>
transaction priority each time before choosing transactions to include<br>
in the current block. The priority being a function of the fee (on a<br>
curve), and the time waiting in the transaction pool (also on a curve)<br>
out to n days (n =3D 60 days ?), and extending past n days. The value for<b=
r>
fee on a curve may need an upper limit. The transaction priority to<br>
serve as the likelihood of a transaction being included in the current<br>
block, and for determining the order in which transactions are tried to<br>
see if they will be included.<br>
<br>
Nodes will need to keep track of when a transaction is first seen. It<br>
is satisfactory for each node to do this independently provided the<br>
full mempool and information survives node restart. If there is a more<br>
reliable way to determine when a transaction was first seen on the<br>
network then it should be utilised.<br>
<br>
&gt; My current default installation of Bitcoin Core v0.15.1 does not<br>
currently seem to save and load the mempool on restart, despite the<br>
notes in the command line options panel that the default for<br>
persistmempool is 1. In the debug panel, some 90,000 transactions<br>
before restart, some 200 odd shortly after. Manually setting<br>
persistmempool=3D1 in the conf file does not seem to make any difference.<b=
r>
Perhaps it is operating as expected and I am not sure what to observe,<br>
but does not seem to be observably saving and loading the mempool on<br>
restart. This will need to be resolved.<br>
<br>
Use a dynamic target block size to make the current block. This marks a<br>
shift from using block size or weight to a count of transactions.<br>
Determine the target block size using; pre-rollout(current average<br>
valid transaction pool size) x ( 1 / (144 x n days ) ) =3D number of<br>
transactions to be included in the current block. The block created<br>
should be a minimum 1MB in size regardless if the target block size is<br>
lower.<br>
<br>
If the created block size consistently contains too few transactions<br>
and the number of new transactions created is continuously greater than<br>
the block size will accommodate then I expect eventually ageing<br>
transactions will be over-represented as a portion of the block<br>
contents. Once another new node conforming to the proposal makes a<br>
block, the block size will be proportionately larger as the transaction<br>
pool has grown.=C2=A0=C2=A0If block size is too large on average then this =
will<br>
shrink the transaction pool.<br>
<br>
Miners will likely want to conform to the proposal, since making blocks<br>
larger than necessary makes more room in each block potentially<br>
lowering the highest fees paid for priority service. Always making<br>
blocks smaller than the proposal requires will in time lower the<br>
utility value of Bitcoin, a different situation but akin to the<br>
current. Transactions will still always confirm but with longer and<br>
longer wait periods. The auction at the front of the queue for priority<br>
will be destroyed as there will be eventually no room in blocks besides<br>
ageing transations and, there will be little value paying higher than<br>
the minimum fee. Obviously, neither of these scenarios are in a miner&#39;s=
<br>
interests.<br>
<br>
Without a consensus as to what size dynamic block to create,<br>
enforcement of dynamic block size is not currently possible. It may be<br>
possible for a consensus to be formed in the future but here I cannot<br>
speculate. I can only suggest that it is in the interest of Bitcoin as<br>
a whole and, in the interest of each node to conform to the proposal.<br>
Some nodes failing to conform to the proposed requirements of dynamic<br>
size or transaction priority in this proposal will not be destructive<br>
to the operation of the proposal.<br>
<br>
If necessary, nodes that have not yet adopted the proposal will just<br>
continue to create standard fixed size unordered blocks, although, if<br>
the current mechanisms of block validation include the fixed block size<br>
then it is unlikely that these nodes will be able to validate the<br>
blockchain going forward. In this case a hard fork and a full transfer<br>
to the new method should be required. If dynamic blocks with ordered<br>
transactions will be valid to existing nodes then only a soft fork is<br>
required. There is no proposed change to the internal construction of<br>
blocks, only to the block size and using an ordered method of<br>
transaction selection.<br>
<br>
&gt; The default value for mempoolexpiry in Bitcoin Core may in future<br>
need to be adjusted to match something more than n days or, perhaps<br>
using less than n =3D 14 days may be a more sensible approach?<br>
<br>
All block created with dynamic size should be verified to ensure<br>
conformity to a probability distribution curve resulting from the<br>
priority method. Since the input is a probability, the output should<br>
conform to a probability distribution.<br>
<br>
The curves used for the priority of transactions would have to be<br>
appropriate. Perhaps a mathematician with experience in probability can<br>
develop the right formulae. My thinking is a steep curve. I suppose<br>
that the probability of all transactions should probably account for a<br>
sufficient number of inclusions that the target block size is met on<br>
average although, it may not always be. As a suggestion, consider<br>
including some dust or zero-fee transactions to pad if each valid<br>
transaction is tried and the target block size is not yet met, highest<br>
BTC transaction value first?<br>
<br>
**Explanation of the operation of priority:**<br>
<br>
&gt; If transaction priority is, for example, a number between one (low)<br=
>
and one-hundred (high) it can be directly understood as the percentage<br>
chance in one-hundred of a transaction being included in the block.<br>
Using probability or likelihood infers that there is some function of<br>
random. Try the transactions in priority order from highest to lowest,<br>
if random (100) &lt; transaction priority then the transaction is included<=
br>
until the target block size is met.=C2=A0<br>
<br>
&gt; To break it down further, if both the fee on a curve value and the<br>
time waiting on a curve value are each a number between one and one-<br>
hundred, a rudimentary method may be to simply multiply those two<br>
numbers, to find the priority number. For example, a middle fee<br>
transaction waiting thirty days (if n =3D 60 days) may have a value of<br>
five for each part=C2=A0=C2=A0(yes, just five, the values are on a curve). =
When<br>
multiplied that will give a priority value of twenty-five, or, a<br>
twenty-five percent chance at that moment of being included in the<br>
block; it will likely be included in one of the next four blocks,<br>
getting more likely each chance. If it is still not included then the<br>
value of time waiting will be higher, making for more probability. A<br>
very low fee transaction would have a value for the fee of one. It<br>
would not be until near sixty-days that the particular low fee<br>
transaction has a high likelihood of being included in the block.<br>
<br>
In practice it may be more useful to use numbers representative of one-<br>
hundred for the highest fee priority curve down to a small fraction of<br>
one for the lowest fee and, from one for a newly seen transaction up to<br>
a proportionately high number above one-hundred for the time waiting<br>
curve. It is truely beyond my level of math to resolve probability<br>
curves accurately without much trial and error.<br>
<br>
The primary reason for addressing the issue is to ensure transactional<br>
reliability and scalability while having each valid transaction confirm<br>
in due time.<br>
<br>
#### Pros<br>
<br>
*=C2=A0=C2=A0=C2=A0Maximizes transaction reliability.<br>
*=C2=A0=C2=A0=C2=A0Overcomes transaction bandwidth limit.<br>
*=C2=A0=C2=A0=C2=A0Fully scalable.<br>
*=C2=A0=C2=A0=C2=A0Maximizes possibility for consumer and business uptake.<=
br>
*=C2=A0=C2=A0=C2=A0Maximizes total fees paid per block without reducing rel=
iability;<br>
because of reliability, in time confidence and overall uptake are<br>
greater; therefore, more transactions.<br>
*=C2=A0=C2=A0=C2=A0Market determines fee paid for transaction priority.<br>
*=C2=A0=C2=A0=C2=A0Fee recommendations work all the way out to 30 days or g=
reater.<br>
*=C2=A0=C2=A0=C2=A0Provides additional block entropy; greater security sinc=
e there is<br>
less probability of predicting the next block. _Although this is not<br>
necessary it is a product of the operation of this proposal._<br>
<br>
#### Cons<br>
<br>
*=C2=A0=C2=A0=C2=A0Could initially lower total transaction fees per block.<=
br>
*=C2=A0=C2=A0=C2=A0Must be first be programmed.<br>
<br>
#### Pre-rollout<br>
<br>
Nodes need to have at a minimum a loose understanding of the average<br>
(since there is no consensus) size of the transaction pool as a<br>
requirement to enable future changes to the way blocks are constructed.<br>
<br>
A new network service should be constructed to meet this need. This<br>
service makes no changes to any existing operation or function of the<br>
node. Initially, Bitcoin Core is a suitable candidate.<br>
<br>
For all operations we count only valid transactions.<br>
<br>
**The service must:**<br>
<br>
*=C2=A0=C2=A0=C2=A0Have an individual temporary (runtime permanent only) Se=
rial Node<br>
ID.<br>
*=C2=A0=C2=A0=C2=A0Accept communication of the number of valid transactions=
 in the<br>
mempool of another valid Bitcoin node along with the Serial Node ID of<br>
the node whose value is provided.<br>
*=C2=A0=C2=A0=C2=A0Disconnect the service from any non-Bitcoin node. Bitcoi=
n Core may<br>
handle this already?<br>
*=C2=A0=C2=A0=C2=A0Expire any value not updated for k minutes (k =3D 30 min=
utes?).<br>
*=C2=A0=C2=A0=C2=A0Broadcast all mempool information the node has every m m=
inutes (m =3D<br>
10 minutes?), including its own.<br>
*=C2=A0=C2=A0=C2=A0Nodes own mempool information should not be broadcast or=
 used in<br>
calculation until the node has been up long enough for the mempool to<br>
normalise for at least o minutes (o =3D 300 minutes ?)<br>
*=C2=A0=C2=A0=C2=A0Alternatively, if loading nodes own full mempool from di=
sk on node<br>
restart (o =3D 30 minutes ?)<br>
*=C2=A0=C2=A0=C2=A0Only new or updated mempool values should be transmitted=
 to the<br>
same node. Updated includes updated with no change.<br>
*=C2=A0=C2=A0=C2=A0All known mempool information must survive node restart.=
<br>
*=C2=A0=C2=A0=C2=A0If the nodes own mempool is not normalised and network i=
nformation<br>
is not available to calculate an average just display zero.<br>
*=C2=A0=C2=A0=C2=A0Internally, the average transaction pool size must retur=
n the<br>
calculated average if an average is available or, if none is available<br>
just the number of valid transactions in the node&#39;s own mempool<br>
regardless if it is normalised.<br>
<br>
Bitcoin Core must use all collated information on mempool size to<br>
calculate a figure for the average mempool size.<br>
<br>
The calculated figure should be displayed in the appropriate place in<br>
the Debug window alongside the text Network average transactions.<br>
<br>
Consideration must be given before development of the network bandwidth<br>
this would require. All programming must be consistent with the current<br>
operation and conventions of Bitcoin Core. Methods must work on all<br>
platforms.<br>
<br>
As this new service does not affect any existing service or feature of<br>
Bitcoin or Bitcoin Core, this can technically be programmed now and<br>
included in Bitcoin Core at any time.<br>
<br>
### 5. Solution operation<br>
<br>
This is a simplistic view of the operation. The actual operation will<br>
need to be determined accurately in a spec for the programmer.<br>
<br>
1.=C2=A0=C2=A0Determine the target block size for the current block.<br>
2.=C2=A0=C2=A0Assign a transaction priority to each valid transaction in th=
e<br>
mempool.<br>
3.=C2=A0=C2=A0Select transactions to include in the current block using<br>
probability in transaction priority order until the target block size<br>
is met. If target block size is not met, include dust and zero-fee<br>
transactions to pad.<br>
4.=C2=A0=C2=A0Solve block.<br>
5.=C2=A0=C2=A0Broadcast the current block when it is solved.<br>
6.=C2=A0=C2=A0Block is received.<br>
7.=C2=A0=C2=A0Block verification process.<br>
8.=C2=A0=C2=A0Accept/reject block based on verification result.<br>
9.=C2=A0=C2=A0Repeat.<br>
<br>
### 6. Closing comments<br>
<br>
It may be possible to verify blocks conform to the proposal by showing<br>
that the probability for all transactions included in the block<br>
statistically conforms to a probability distribution curve, *if* the<br>
individual transaction priority can be recreated. I am not that deep<br>
into the mathematics; however, it may also be possible to use a similar<br>
method to do this just based on the fee, that statistically, the block<br>
conforms to a fee distribution. Any dust and zero-fee transactions<br>
would have to be ignored. This solution needs a competent mathematician<br>
with experience in probability and statistical distribution.<br>
<br>
It is trivial to this proposal to offer that a node provides the next<br>
block size with a block when it is solved. I am not sure that this<br>
creates any actual benefit since the provided next block size is only<br>
one node&#39;s view, as it is the node may seemingly just as well use its<b=
r>
own view and create the block. Providing a next block size only adds<br>
additional complexity to the required operation, however, perhaps<br>
providing the next block size is not trivial in what is accomplished<br>
and the feature can be included in the operation.<br>
<br>
Instead of the pre-rollout network service providing data as to valid<br>
transactions in mempool, it could directly provide data as to the<br>
suggested next block size if that is preferred, using a similar<br>
operation as is suggested now and averaging all received suggested next<br>
block sizes.<br>
<br>
It may be foreseeable in the future for Bitcoin to operate with a<br>
network of dedicated full blockchain &amp; mempool servers. This would not<=
br>
be without challenges to overcome but would offer several benefits,<br>
including to the operation of this proposal, and especially as the RAM<br>
and storage requirements of a full node grows. It is easy to foresee<br>
that in just another seven years of operation a Bitcoin Full Node will<br>
require at least 300GB of storage and, if the mempool only doubles in<br>
size, over 1GB of RAM.<br>
<br>
There has been some concern expressed over spam and very low fee<br>
transactions, and an infinite block size resulting. I hope that for<br>
those concerned using the dust level addresses the issue, especially as<br>
the value of Bitcoin grows.<br>
<br>
Notwithstanding this proposal, all blocks including those with dynamic<br>
size each have limited transaction space per block. This proposal<br>
results in a fee for priority service auction, where the probability of<br>
a transaction to be included in limited space in the next available<br>
block is auctioned to the highest bidders and all other transactions<br>
must wait until they reach priority by ageing to gain significant<br>
probability. Under this proposal the mempool can grow quite large while<br>
the confirmation service continues in a stable and reliable manner.<br>
Several incentives for attackers are removed, where there is no longer<br>
multiple potential incentives for unnecessarily filling blocks or<br>
flooding the mempool with transactions, whether such transactions are<br>
fraudulent, valid or, otherwise. Adoption of this proposal and<br>
adherence results in a reliable, stable fee paying transaction<br>
confirmation service and a beneficial auction.<br>
<br>
This proposal is necessary. I implore, at the very least, that we use<br>
some method that validates full transaction reliability and enables<br>
scalability of Bitcoin. If not this proposal, an alternative.<br>
<br>
I have done as much with this proposal as I feel that I am able so far<br>
but continue to take your feedback.<br>
<br>
Regards, =C2=A0<br>
Damian Williamson<br>
<br>
[![Creative Commons License](<a></a><a href=3D"https://i.creativecommons.or=
g/l/by-sa/4.0/" target=3D"_blank">https://i.<wbr>creativecommons.org/l/by-s=
a/4.<wbr>0/</a><br>
88x31.png)](<a href=3D"http://creativecommons.org/licenses/by-sa/4.0/" targ=
et=3D"_blank">http://<wbr>creativecommons.org/licenses/<wbr>by-sa/4.0/</a>)=
 =C2=A0<br>
&lt;span xmlns:dct=3D&quot;<a href=3D"http://purl.org/dc/terms/" target=3D"=
_blank">http://purl.org/dc/<wbr>terms/</a>&quot;<br>
href=3D&quot;<a href=3D"http://purl.org/dc/dcmitype/Text" target=3D"_blank"=
>http://purl.org/dc/<wbr>dcmitype/Text</a>&quot; property=3D&quot;dct:title=
&quot;<br>
rel=3D&quot;dct:type&quot;&gt;BIP Proposal: UTPFOTIB - Use Transaction Prio=
rity For<br>
Ordering Transactions In Blocks&lt;/span&gt; by [Damian Williamson<br>
&amp;<a href=3D"mailto:lt%3Bwilltech@live.com.au" target=3D"_blank">lt;will=
tech@live.com.au</a>&amp;gt;](<a href=3D"http://thekingjameshrmh.tumblr.com=
/post/1" target=3D"_blank"><wbr>http://thekingjameshrmh.<wbr>tumblr.com/pos=
t/1</a><br>
68948530950/bip-proposal-<wbr>utpfotib-use-transaction-<wbr>priority-for-or=
der)<br>
is licensed under a [Creative Commons Attribution-ShareAlike 4.0<br>
International License](<a href=3D"http://creativecommons.org/licenses/by-sa=
/4.0/" target=3D"_blank">http://<wbr>creativecommons.org/licenses/<wbr>by-s=
a/4.0/</a>).<br>
Based on a work at <a href=3D"https://lists.linuxfoundation.org/pipermail/b=
itcoin-" target=3D"_blank">
https://lists.linuxfoundation.<wbr>org/pipermail/bitcoin-</a><br>
dev/2017-<br>
December/015371.html](<a href=3D"https://lists.linuxfoundation.org/pipermai=
l/bitco" target=3D"_blank">https://<wbr>lists.linuxfoundation.org/<wbr>pipe=
rmail/bitco</a><br>
in-dev/2017-December/015371.<wbr>html).<br>
Permissions beyond the scope of this license may be available at [https<br>
://<a href=3D"http://opensource.org/licenses/BSD-3-" target=3D"_blank">open=
source.org/licenses/<wbr>BSD-3-</a><br>
Clause](<a href=3D"https://opensource.org/licenses/BSD-3-Clause" target=3D"=
_blank">https://opensource.<wbr>org/licenses/BSD-3-Clause</a>).<br>
<br>
<br>
______________________________<wbr>_________________<br>
bitcoin-dev mailing list<br>
<a href=3D"mailto:bitcoin-dev@lists.linuxfoundation.org" target=3D"_blank">=
bitcoin-dev@lists.<wbr>linuxfoundation.org</a><br>
<a href=3D"https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev" =
target=3D"_blank">https://lists.linuxfoundation.<wbr>org/mailman/listinfo/b=
itcoin-<wbr>dev</a><br>
</div>
</span></font></div>
</div>
</div>
</div>
</div>
</div></div></div>

<br>______________________________<wbr>_________________<br>
bitcoin-dev mailing list<br>
<a href=3D"mailto:bitcoin-dev@lists.linuxfoundation.org">bitcoin-dev@lists.=
<wbr>linuxfoundation.org</a><br>
<a href=3D"https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev" =
rel=3D"noreferrer" target=3D"_blank">https://lists.linuxfoundation.<wbr>org=
/mailman/listinfo/bitcoin-<wbr>dev</a><br>
<br></blockquote></div><br></div>

--94eb2c047078e3ceac0563364327--