MinRelayFee algorithm revist #9328

issue rebroad opened this issue on December 12, 2016
  1. rebroad commented at 8:28 AM on December 12, 2016: contributor

    Currently, when looking at the historical MinRelayFee over time, it's usual pattern is to suddenly jump high when the Memory Usage reaches 100% to then slowly decrease until the same happens again. This causes wildly fluctuating MinRelayFees.

    Intuitively I feel that the maths could be improved such that the MinRelayFee goes up prior to reaching 100% utilization such that an equilibrium can be reached where the memory utilization rarely reaches 100% and the MinRelayFee stays fairly constant (save for influences by market dynamics). For this to be possible the algorithm needs to change to at least allow it to increase in situations other than reaching 100% utilization.

  2. paveljanik commented at 8:36 AM on December 12, 2016: contributor

    Please change the subject to "Predict the future".

  3. rebroad commented at 8:42 AM on December 12, 2016: contributor

    @paveljanik I appreciate the levity :) I think the future does not need to be predictable for what I am suggesting but perhaps I am not being clear in what I am proposing. I am proposing that the algorithm tries to avoid sudden jumps, so for this to happen it needs to be something akin to the physics of two magnets opposing each other - i.e. when it gets nearer to being full the MinFeeFilter goes up at a rate such that it is unlikely to become full.

    There may need to be some mathematical differentiation to achieve this where the speed at which 100% is being reached if used to decelerate it enough to stop it being reached. Inertial dampening I think might be the term for it. What we currently have is oscillation. Oscillation equals inefficiency. Same as traffic on the highway stopping and starting, the oscillations which can last for hours from their initial impetus, causing everyone to get to their destination slower than if the traffic was going along smoothly at the permitted speed.

    I'm not saying the current algorithm is poor/bad/broken, but I am wondering if it can be more static than it currently is and therefore allow the memory used to be more static and therefore fluctuations in the TX throughput in the network to be reduced.

    If I am missing something here, please let me know.

  4. fanquake added the label TX fees and policy on Dec 13, 2016
  5. MarcoFalke added the label Brainstorming on Oct 7, 2017
  6. MarcoFalke commented at 2:40 PM on October 7, 2017: member

    Can you explain the technical advantages of such approach?

  7. MarcoFalke closed this on Apr 27, 2020

  8. DrahtBot locked this on Feb 15, 2022

github-metadata-mirror

This is a metadata mirror of the GitHub repository bitcoin/bitcoin. This site is not affiliated with GitHub. Content is generated from a GitHub metadata backup.
generated: 2026-04-17 09:15 UTC

This site is hosted by @0xB10C
More mirrored repositories can be found on mirror.b10c.me