diff options
| author | Pieter Wuille <[email protected]> | 2011-05-26 00:38:20 +0200 |
|---|---|---|
| committer | Pieter Wuille <[email protected]> | 2011-05-26 00:54:58 +0200 |
| commit | 2bfda1be11a079f7b468c79d79a91ddb30369557 (patch) | |
| tree | 989373a1154f39dc222b234a8acaf32684462bb8 /src/main.cpp | |
| parent | Merge pull request #265 from TheBlueMatt/esfix2 (diff) | |
| download | discoin-2bfda1be11a079f7b468c79d79a91ddb30369557.tar.xz discoin-2bfda1be11a079f7b468c79d79a91ddb30369557.zip | |
Separate required fee for relaying and creation
Transactions created with the new minimal fee policy would not be
relayed by the network. Therefore, we separate the minimal fee that
is necessary to relay and to create, leaving the creation one at
the old amount, for now.
Diffstat (limited to 'src/main.cpp')
| -rw-r--r-- | src/main.cpp | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/main.cpp b/src/main.cpp index 68b6b4ee1..f5f1ffd4a 100644 --- a/src/main.cpp +++ b/src/main.cpp @@ -731,13 +731,13 @@ bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMi } // Don't accept it if it can't get into a block - if (nFees < GetMinFee(1000)) + if (nFees < GetMinFee(1000, false, true)) return error("AcceptToMemoryPool() : not enough fees"); // Continuously rate-limit free transactions // This mitigates 'penny-flooding' -- sending thousands of free transactions just to // be annoying or make other's transactions take longer to confirm. - if (nFees < MIN_TX_FEE) + if (nFees < MIN_RELAY_TX_FEE) { static CCriticalSection cs; static double dFreeCount; @@ -3329,7 +3329,7 @@ CBlock* CreateNewBlock(CReserveKey& reservekey) // Transaction fee required depends on block size bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority)); - int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree); + int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree, true); // Connecting shouldn't fail due to dependency on other memory pool transactions // because we're already processing them in order of dependency |