From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from smtp1.linuxfoundation.org (smtp1.linux-foundation.org [172.17.192.35]) by mail.linuxfoundation.org (Postfix) with ESMTPS id ADC0DC7D for ; Sun, 7 Apr 2019 18:52:49 +0000 (UTC) X-Greylist: whitelisted by SQLgrey-1.7.6 Received: from mail-ed1-f49.google.com (mail-ed1-f49.google.com [209.85.208.49]) by smtp1.linuxfoundation.org (Postfix) with ESMTPS id EEB1A709 for ; Sun, 7 Apr 2019 18:52:48 +0000 (UTC) Received: by mail-ed1-f49.google.com with SMTP id q3so4321994edg.0 for ; Sun, 07 Apr 2019 11:52:48 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20161025; h=mime-version:references:in-reply-to:from:date:message-id:subject:to; bh=4cdhOzSQ8RCBiFnpN9IOITJ5+oPZIYxB3Y26VZIQaF4=; b=B6V1pr5dnfXLCX1WTeRpiJyTKN3+DTmp3WlcBUdMF5GrDHloRsvpDW2fwdykreAN1z uC6v4ko4LyXoZ3qvgywoU6qgChpke9JICgSo3WwhpkB5b778aGKALRXy0+ffP0LMmzfk 2j2XI6x7NRZIp+PArklpWxe8kIWn05PkH2RGCmnsHb7oMNwI7TQdaZAq+dNMjME6zZyP 1U4pXzJK/FEV3X/nT/tvdMn1s2CIyct1FS100vLeO8L+pRigD1w8FLw8YXCbDwTtFoh8 e/XAed5/HHEYa6scqYUwP6t7WdwJgz8p9+334/kEKCSkZ8mBxMbOVGjbaKEU6isXxXv0 0OdA== X-Google-DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=1e100.net; s=20161025; h=x-gm-message-state:mime-version:references:in-reply-to:from:date :message-id:subject:to; bh=4cdhOzSQ8RCBiFnpN9IOITJ5+oPZIYxB3Y26VZIQaF4=; b=lue9vrdTTMXmaOb5QP6udErnh1Ty5RnLnAjuVpzqQlqYzI0dAdd/hEWQ+A74lafY44 EBm5Bx6Czy2MxhbXmz3l7U0KB1Db/upS/z5/+3624W1Q+hobhfs091/OrETKM531KivE X8u35hzyeL5ZHclXW6xMl2/j0ZPMmBkLzTElljuBw4v7PrA7rvYDANfha2ruIRd14fPW EGc3L0N+go7BB36Nx3JsNJcz8qxlwgW+/avrjUyQ3HuhEM4atFz7O80GiOCLJZb4kAlt uFFKAm4/KNUmURYA2+eHWrGx89PwTna1C9y04YemKPxkEVzsElt1woSvsLtB/XpyabZA pnKg== X-Gm-Message-State: APjAAAWWImRsgArAgJ9x6QrBIj70K7p2ITGslYoD03b3C4cxYp+uXXRt E23oJDiamOZmUq7BuLNtHb3gepNBM+eCAakkovA= X-Google-Smtp-Source: APXvYqwpn3bnwiF/WLNh5KlWIm1sln2r1nvEBO5MCv7kjigfjtJqqdeYEpLd0MbzI2qgxuOgQ0lu/RCah55BekW6tFM= X-Received: by 2002:aa7:d294:: with SMTP id w20mr16387267edq.253.1554663167541; Sun, 07 Apr 2019 11:52:47 -0700 (PDT) MIME-Version: 1.0 References: In-Reply-To: From: Natanael Date: Sun, 7 Apr 2019 20:52:30 +0200 Message-ID: To: simondev1 , Bitcoin Dev Content-Type: multipart/alternative; boundary="000000000000d8c62c0585f539b3" 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: Mon, 08 Apr 2019 01:50:15 +0000 Subject: Re: [bitcoin-dev] new BIP: Self balancing between excessively low/high fees and block size X-BeenThere: bitcoin-dev@lists.linuxfoundation.org X-Mailman-Version: 2.1.12 Precedence: list List-Id: Bitcoin Protocol Discussion List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sun, 07 Apr 2019 18:52:49 -0000 --000000000000d8c62c0585f539b3 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: quoted-printable Related ideas previously submitted by me; https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2017-March/013885.h= tml Title: Block size adjustment idea - expedience fees + difficulty scaling proportional to block size (+ fee pool) Den s=C3=B6n 7 apr. 2019 17:45simondev1 via bitcoin-dev < bitcoin-dev@lists.linuxfoundation.org> skrev: > Dear bitcoin developers, > > New BIP: https://github.com/bitcoin/bips/pull/774 > > =3D=3DAbstract=3D=3D > Logarithm of transaction fee limits block size. > > =3D=3DMotivation=3D=3D > Keep block space small. > Waste less with spam transactions. > Auto balance Fees: Increase very low fees, Descrease very high fees. > Allow larger size when sender pays a lot. > Allow wallets to calculate/display how much average free block space ther= e > is for each fee price. > Allow senders to have more control about how the fee/priority of their > transaction will behave, especially in the case of increased adoption in > the future. > > =3D=3DSpecification=3D=3D > Every transaction has to fit into the following block space: > Input variable 'FeeInSatoshiPerByte': Must be positive or 0 > type: double > unit: Satishi per byte > Output: > type: uint > unit: bytes > Formula: > floor( log10( 1.1 + FeeInSatoshiPerByte ) * 1024 * 1024 ) > > =3D=3DImplementation=3D=3D > Sort transactions by FeeInSatoshiPerByte (lowest first) > For each transaction starting from lowest FeeInSatoshiPerByte: Sum up the > bytes of space used so far. Check if summed up bytes of space used so far > is smaller or equal than the formula result. > If this is valid for each transaction then the blocksize is valid. > > =3D=3DBackward compatibility=3D=3D > Soft fork: If applied AND old hardcoded block size limit is kept. > Hard fork: If applied AND old hardcoded block size limit is removed. > > Regards, simondev1 > > _______________________________________________ > bitcoin-dev mailing list > bitcoin-dev@lists.linuxfoundation.org > https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev > --000000000000d8c62c0585f539b3 Content-Type: text/html; charset="UTF-8" Content-Transfer-Encoding: quoted-printable
Related ideas previously submitted by me;


Title: Block size adjustment idea - exped= ience fees + difficulty scaling proportional to block size (+ fee pool)=C2= =A0

Den s=C3=B6n 7 apr. 2019 17:45simondev1 via bitcoin-dev <bitcoin-dev@lists.linuxf= oundation.org> skrev:
<= div style=3D"font-family:Verdana;font-size:12.0px">
Dear bitcoin developers,
=C2=A0
=C2=A0
=3D=3DAbstract=3D=3D
Logarithm of transaction fee limits block size.
=C2=A0
=3D=3DMotivation=3D=3D
Keep block space small.
Waste less with spam transactions.
Auto balance Fees: Increase very low fees, Descrease very high fees.
Allow larger size when sender pays a lot.
Allow wallets to calculate/display how much average free block space there = is for each fee price.
Allow senders to have more control about how the fee/priority of their tran= saction will behave, especially in the case of increased adoption in the fu= ture.
=C2=A0
=3D=3DSpecification=3D=3D
Every transaction has to fit into the following block space:
Input variable 'FeeInSatoshiPerByte': Must be positive or 0 type: double
unit: Satishi per byte
Output:
type: uint
unit: bytes
Formula:
floor( log10( 1.1 + FeeInSatoshiPerByte ) * 1024 * 1024 )
=C2=A0
=3D=3DImplementation=3D=3D
Sort transactions by FeeInSatoshiPerByte (lowest first)
For each transaction starting from lowest FeeInSatoshiPerByte: Sum up the b= ytes of space used so far. Check if summed up bytes of space used so far is= smaller or equal than the formula result.
If this is valid for each transaction then the blocksize is valid.
=C2=A0
=3D=3DBackward compatibility=3D=3D
Soft fork: If applied AND old hardcoded block size limit is kept.
Hard fork: If applied AND old hardcoded block size limit is removed.

Regards, simondev1
=C2=A0
_______________________________________________
bitcoin-dev mailing list
bitcoin-dev@lists.linuxfoundation.org
https://lists.linuxfoundati= on.org/mailman/listinfo/bitcoin-dev
--000000000000d8c62c0585f539b3--