aboutsummaryrefslogtreecommitdiff
path: root/tests/unit_tests/fee.cpp (follow)
AgeCommit message (Collapse)AuthorFilesLines
2018-09-11v8: per byte fee, pad bulletproofs, fixed 11 ring sizemoneromooo-monero1-27/+27
2018-01-26Update 2018 copyrightxmr-eric1-1/+1
2017-03-15Add intervening v5 fork for increased min block sizemoneromooo-monero1-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-04unit_tests: fix fee tests after quantization changemoneromooo-monero1-22/+35
2017-02-21update copyright year, fix occasional lack of newline at line endRiccardo Spagni1-1/+1
2016-11-13tests: fix another fee test on 32 bitmoneromooo-monero1-1/+1
2016-11-10tests: fix fee unit tests on 32 bitmoneromooo-monero1-3/+5
2016-10-31core: dynamic fee algorithm from ArticMinemoneromooo-monero1-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