Age | Commit message (Collapse) | Author | Files | Lines | |
---|---|---|---|---|---|
2018-09-11 | v8: per byte fee, pad bulletproofs, fixed 11 ring size | moneromooo-monero | 1 | -27/+27 | |
2018-01-26 | Update 2018 copyright | xmr-eric | 1 | -1/+1 | |
2017-03-15 | Add intervening v5 fork for increased min block size | moneromooo-monero | 1 | -25/+25 | |
Minimum mixin 4 and enforced ringct is moved from v5 to v6. v5 is now used for an increased minimum block size (from 60000 to 300000) to cater for larger typical/minimum transaction size. The fee algorithm is also changed to decrease the base per kB fee, and add a cheap tier for those transactions which we do not care if they get delayed (or even included in a block). | |||||
2017-03-04 | unit_tests: fix fee tests after quantization change | moneromooo-monero | 1 | -22/+35 | |
2017-02-21 | update copyright year, fix occasional lack of newline at line end | Riccardo Spagni | 1 | -1/+1 | |
2016-11-13 | tests: fix another fee test on 32 bit | moneromooo-monero | 1 | -1/+1 | |
2016-11-10 | tests: fix fee unit tests on 32 bit | moneromooo-monero | 1 | -3/+5 | |
2016-10-31 | core: dynamic fee algorithm from ArticMine | moneromooo-monero | 1 | -0/+121 | |
The fee will vary based on the base reward and the current block size limit: fee = (R/R0) * (M0/M) * F0 R: base reward R0: reference base reward (10 monero) M: block size limit M0: minimum block size limit (60000) F0: 0.002 monero Starts applying at v4 |