Coder Social home page Coder Social logo

Fix dynamic difficulty-driven fee about karbo HOT 3 OPEN

aivve avatar aivve commented on June 24, 2024
Fix dynamic difficulty-driven fee

from karbo.

Comments (3)

aivve avatar aivve commented on June 24, 2024

To work, this system requires stable and unchanging mining algo and/or stable and unchanging mining conditions, thus the development of ASICs rendered it completely useless. Although, the all-time avg. diff and reward as a reference look neat and is trailing, it may completely miss the shot. It builds up and incorporates avg. difficulty change caused by ASICs but I think it does not correspond to the price we want for the reference.

from karbo.

aivve avatar aivve commented on June 24, 2024

Anyways, even if it is left intact, upon algo change the historical avg. diff and reward should be calculated starting from the new algo height.

from karbo.

aivve avatar aivve commented on June 24, 2024

So, currently, minimal network fee is calculated according to this formula F = S * A / D where A​ as "Average difficulty constant, corresponding to the chosen level of fiat price" from whitepaper was replaced by "Average all-time difficulty", D is "average difficulty for the ~ last month" to make fee change smooth. To be exact it is D = E * 7 * 4, where E is "Expected number of blocks per day", i.e. ~ 4 weeks.

The fixed/static reference difficulty may not be correct because growing adoption may cause difficulty to grow, therefore maybe trailing avg difficulty (currently active and described above) is indeed a correct solution. Moreover, this way maybe it can adjust itself automatically without the need for intervention by devs, and perhaps even in such major changes in hashrate and difficulty as the advent of ASICs.

And, perhaps, in the case of algo change, average difficulty should be reset. It is because it is driven high by ASICs and will stay very high for a long time, and will not allow the fee to drop.

It can be done by deducing cumulative difficulty up to the point of hardfork, in other words start caclulating cumulative difficulty from the height of hardfork:

D = Dt - Dh

where D is the new reference difficulty we want, Dt is total cumulative difficulty, Dh is cumulative difficulty at the height of hardfork.

After the hardfork it should be calculated according to formula F = S * A / (Dt - Dh).

from karbo.

Related Issues (2)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.