aboutsummaryrefslogtreecommitdiff
path: root/src/txmempool.h
Commit message (Collapse)AuthorAgeFilesLines
...
| * Add LockPointsAlex Morcos2016-03-161-1/+31
| | | | | | | | Obtain LockPoints to store in CTxMemPoolEntry and during a reorg, evaluate whether they are still valid and if not, recalculate them.
* | Add tags to mempool's mapTx indicesSuhas Daftuar2016-02-161-0/+8
|/
* Merge pull request #7205Wladimir J. van der Laan2016-01-051-1/+1
|\ | | | | | | | | | | fa71669 [devtools] Use git pretty-format for year parsing (MarcoFalke) fa24439 Bump copyright headers to 2015 (MarcoFalke) fa6ad85 [devtools] Rewrite fix-copyright-headers.py (MarcoFalke)
| * Bump copyright headers to 2015MarcoFalke2015-12-131-1/+1
| |
* | Fix mempool limiting for PrioritiseTransactionSuhas Daftuar2015-12-021-21/+22
|/ | | | | | | Redo the feerate index to be based on mining score, rather than fee. Update mempool_packages.py to test prioritisetransaction's effect on package scores.
* Get the set of now-uncacheable-txn from CTxMemPool::TrimToSizeMatt Corallo2015-12-011-2/+5
|
* Make accessing mempool parents and children publicAlex Morcos2015-12-011-2/+2
|
* Add TxPriority class and comparatorAlex Morcos2015-12-011-0/+13
|
* Add a score index to the mempool.Alex Morcos2015-12-011-1/+39
| | | | The score index is meant to represent the order of priority for being included in a block for miners. Initially this is set to the transactions modified (by any feeDelta) fee rate. Index improvements and unit tests by sdaftuar.
* Store the total sig op count of a tx.Alex Morcos2015-12-011-1/+4
| | | | Store sum of legacy and P2SH sig op counts. This is calculated in AcceptToMemory pool and storing it saves redoing the expensive calculation in block template creation.
* Fix removeForReorg to use MedianTimePastSuhas Daftuar2015-11-301-1/+1
|
* Track coinbase spends in CTxMemPoolEntrySuhas Daftuar2015-11-301-1/+4
| | | | This allows us to optimize CTxMemPool::removeForReorg.
* Fix removal of time-locked transactions during reorgMatt Corallo2015-11-301-1/+1
|
* Change GetPriority calculation.Alex Morcos2015-11-191-1/+7
| | | | Compute the value of inputs that already are in the chain at time of mempool entry and only increase priority due to aging for those inputs. This effectively changes the CTxMemPoolEntry's GetPriority calculation from an upper bound to a lower bound.
* Modify variable names for entry height and priorityAlex Morcos2015-11-191-4/+4
|
* Remove default arguments for CTxMemPoolEntry()Alex Morcos2015-11-191-1/+1
|
* Merge pull request #6871Wladimir J. van der Laan2015-11-271-4/+5
|\ | | | | | | | | | | | | | | | | | | | | | | 63b5840 Fix usage of local python-bitcoinlib (Peter Todd) 16a2f93 Fix incorrect locking of mempool during RBF replacement (Peter Todd) 97203f5 Port test to rpc-test framework (Suhas Daftuar) 20367d8 Add test for max replacement limit (Suhas Daftuar) 73d9040 Improve RBF replacement criteria (Suhas Daftuar) b272ecf Reject replacements that add new unconfirmed inputs (Peter Todd) fc8c19a Prevent low feerate txs from (directly) replacing high feerate txs (Peter Todd) 0137e6f Add tests for transaction replacement (Peter Todd) 5891f87 Add opt-in full-RBF to mempool (Peter Todd)
| * Improve RBF replacement criteriaSuhas Daftuar2015-11-101-4/+5
| | | | | | | | Fix the calculation of conflicting size/conflicting fees.
* | Add smart fee estimation functionsAlex Morcos2015-11-161-0/+12
|/ | | | These are more useful fee and priority estimation functions. If there is no fee/pri high enough for the target you are aiming for, it will give you the estimate for the lowest target that you can reliably obtain. This is better than defaulting to the minimum. It will also pass back the target for which it returned an answer.
* Make -checkmempool=1 not fail through int32 overflowPieter Wuille2015-10-281-1/+1
|
* Merge pull request #6776Pieter Wuille2015-10-281-2/+2
|\ | | | | | | ab1f560 Support -checkmempool=N, which runs checks on average once every N transactions (Pieter Wuille)
| * Support -checkmempool=N, which runs checks on average once every N transactionsPieter Wuille2015-10-201-2/+2
| |
* | fix locking issue with new mempool limitingJonas Schnelli2015-10-261-0/+1
| | | | | | | | Current master crashes on OSX with an exception: "boost: mutex lock failed in pthread_mutex_lock: Invalid argument"
* | Fix comment formatting tabsMatt Corallo2015-10-141-5/+5
| |
* | Add reasonable test case for mempool trimmingMatt Corallo2015-10-131-1/+3
| |
* | Implement on-the-fly mempool size limitation.Matt Corallo2015-10-131-0/+18
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | After each transaction which is added to mempool, we first call Expire() to remove old transactions, then throwing away the lowest-feerate transactions. After throwing away transactions by feerate, we set the minimum relay fee to the maximum fee transaction-and-dependant-set we removed, plus the default minimum relay fee. After the next block is received, the minimum relay fee is allowed to decrease exponentially. Its halflife defaults to 12 hours, but is decreased to 6 hours if the mempool is smaller than half its maximum size, and 3 hours if the mempool is smaller than a quarter its maximum size. The minimum -maxmempool size is 40*-limitdescendantsize, as it is easy for an attacker to play games with the cheapest -limitdescendantsize transactions. -maxmempool defaults to 300MB. This disables high-priority transaction relay when the min relay fee adjustment is >0 (ie when the mempool is full). When the relay fee adjustment drops below the default minimum relay fee / 2 it is set to 0 (re-enabling priority-based free relay).
* | Track (and define) ::minRelayTxFee in CTxMemPoolMatt Corallo2015-10-131-1/+8
| |
* | Fix calling mempool directly, instead of pool, in ATMPMatt Corallo2015-10-131-2/+2
| |
* | Add Mempool Expire function to remove old transactionsPieter Wuille2015-10-131-1/+10
| | | | | | | | | | | | (note the 9x multiplier on (void*)'s for CTxMemPool::DynamicMemoryUsage was accidentally introduced in 5add7a7 but should have waited for this commit which adds the extra index)
* | Reverse the sort on the mempool's feerate indexSuhas Daftuar2015-10-131-2/+2
|/
* Fix mempool package tracking edge caseSuhas Daftuar2015-09-231-1/+3
| | | | | | | | | | CalculateMemPoolAncestors was always looping over a transaction's inputs to find in-mempool parents. When adding a new transaction, this is the correct behavior, but when removing a transaction, we want to use the ancestor set that would be calculated by walking mapLinks (which should in general be the same set, except during a reorg when the mempool is in an inconsistent state, and the mapLinks-based calculation would be the correct one).
* Track transaction packages in CTxMemPoolEntrySuhas Daftuar2015-09-191-7/+266
| | | | | | | | | | | | | Associate with each CTxMemPoolEntry all the size/fees of descendant mempool transactions. Sort mempool by max(feerate of entry, feerate of descendants). Update statistics on-the-fly as transactions enter or leave the mempool. Also add ancestor and descendant limiting, so that transactions can be rejected if the number or size of unconfirmed ancestors exceeds a target, or if adding a transaction would cause some other mempool entry to have too many (or too large) a set of unconfirmed in- mempool descendants.
* TxMemPool: Change mapTx to a boost::multi_index_containerAshley Holman2015-09-191-1/+41
| | | | | | Indexes on: - Tx Hash - Fee Rate (fee-per-kb)
* Implement accurate memory accounting for mempoolPieter Wuille2015-07-101-0/+7
|
* Create new BlockPolicyEstimator for fee estimatesAlex Morcos2015-05-131-7/+13
| | | | | | | | | | | | | | | | This class groups transactions that have been confirmed in blocks into buckets, based on either their fee or their priority. Then for each bucket, the class calculates what percentage of the transactions were confirmed within various numbers of blocks. It does this by keeping an exponentially decaying moving history for each bucket and confirm block count of the percentage of transactions in that bucket that were confirmed within that number of blocks. -Eliminate txs which didn't have all inputs available at entry from fee/pri calcs -Add dynamic breakpoints and tracking of confirmation delays in mempool transactions -Remove old CMinerPolicyEstimator and CBlockAverage code -New smartfees.py -Pass a flag to the estimation code, using IsInitialBlockDownload as a proxy for when we are still catching up and we shouldn't be counting how many blocks it takes for transactions to be included. -Add a policyestimator unit test
* Added "Core" to copyright headerssandakersmann2014-12-191-1/+1
| | | | | Github-Pull: #5494 Rebased-From: 15de949bb9277e442302bdd8dee299a8d6deee60
* Remove txn which are invalidated by coinbase maturity during reorgMatt Corallo2014-12-081-0/+1
|
* MOVEONLY: core/ -> primitives/Luke Dashjr2014-12-031-1/+1
|
* [Qt] Add Smartfee to GUICozz Lovan2014-11-191-1/+6
|
* Update comments in txmempool to be doxygen compatibleMichael Ford2014-11-171-21/+23
| | | | Fix typo in Read() error message
* MOVEONLY: Separate CTransaction and dependencies from corejtimon2014-10-271-1/+1
|
* MOVEONLY: Move CFeeRate and Amount constants to amount.ojtimon2014-10-271-0/+1
|
* boost: split stream classes out of serialize.hCory Fields2014-10-221-0/+2
| | | | serialization now has no dependencies.
* MOVEONLY: CInPoint from core to txmempooljtimon2014-10-171-0/+13
|
* Merge pull request #4834Pieter Wuille2014-10-081-1/+1
|\ | | | | | | | | | | | | | | 7c70438 Get rid of the dummy CCoinsViewCache constructor arg (Pieter Wuille) ed27e53 Add coins_tests with a large randomized CCoinViewCache test. (Pieter Wuille) 058b08c Do not keep fully spent but unwritten CCoins entries cached. (Pieter Wuille) c9d1a81 Get rid of CCoinsView's SetCoins and SetBestBlock. (Pieter Wuille) f28aec0 Use ModifyCoins instead of mutable GetCoins. (Pieter Wuille)
| * Get rid of the dummy CCoinsViewCache constructor argPieter Wuille2014-09-241-1/+1
| |
* | Use a typedef for monetary valuesMark Friedenbach2014-09-261-6/+6
|/
* Track modified size in TxMemPoolEntry so that we can correctly compute priority.Alex Morcos2014-09-081-0/+1
|
* add missing header end commentsPhilip Kaufmann2014-08-281-1/+2
| | | | | | - ensures a consistent usage in header files - also add a blank line after the copyright header where missing - also remove orphan new-lines at the end of some files
* Use const CCoinsView's at some places.Daniel Kraft2014-08-261-1/+1
| | | | | At some places where it is possible (e. g., CheckInputs), use a const version of CCoinsView instead of a non-const one.
generated by cgit v1.2.3 (git 2.25.1) at 2026-04-21 14:44:23 +0000