aboutsummaryrefslogtreecommitdiff
path: root/src/main.cpp
Commit message (Collapse)AuthorAgeFilesLines
...
| * | | | | | Save the last unnecessary database readAlex Morcos2015-11-181-10/+2
| | | | | | | | | | | | | | | | | | | | | | | | | | | | It's possible coins with the same hash exist when you create a duplicate coinbase, so previously we were reading from the database to make sure we had the old coins cached so if we were to spend the new ones, the old ones would also be spent. This pull instead just marks the new coins as not fresh if they are from a coinbase, so if they are spent they will be written all the way down to the database anyway overwriting any duplicates.
* | | | | | | Add option `-permitrbf` to set transaction replacement policyWladimir J. van der Laan2016-01-211-4/+8
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Add a configuration option `-permitrbf` to set transaction replacement policy for the mempool. Enabling it will enable (opt-in) RBF, disabling it will refuse all conflicting transactions.
* | | | | | | Merge pull request #7281: Improve CheckInputs() comment about sig verificationWladimir J. van der Laan2016-01-191-3/+6
|\ \ \ \ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | fd83615 Improve CheckInputs() comment about sig verification (Peter Todd)
| * | | | | | | Improve CheckInputs() comment about sig verificationPeter Todd2016-01-031-3/+6
| | | | | | | |
* | | | | | | | Merge pull request #7164: Do not download transactions during initial ↵Wladimir J. van der Laan2016-01-191-1/+1
|\ \ \ \ \ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | blockchain sync 39a525c Do not download transactions during inital sync (ptschip)
| * | | | | | | | Do not download transactions during inital syncptschip2015-12-151-1/+1
| | |_|/ / / / / | |/| | | | | |
* | | | | | | | Merge pull request #7208Wladimir J. van der Laan2016-01-181-1/+4
|\ \ \ \ \ \ \ \ | |_|_|_|/ / / / |/| | | | | | | | | | | | | | | 64360f1 Make max tip age an option instead of chainparam (Wladimir J. van der Laan)
| * | | | | | | Make max tip age an option instead of chainparamWladimir J. van der Laan2015-12-141-1/+4
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | After discussion in #7164 I think this is better. Max tip age was introduced in #5987 to make it possible to run testnet-in-a-box. But associating this behavior with the testnet chain is wrong conceptually, as it is not needed in normal usage. Should aim to make testnet test the software as-is. Replace it with a (debug) option `-maxtipage`, which can be specified only in the specific case.
* | | | | | | | Merge pull request #7081Wladimir J. van der Laan2016-01-091-8/+10
|\ \ \ \ \ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | 45b8e27 -bytespersigop option to additionally limit sigops in transactions we relay and mine (Luke Dashjr)
| * \ \ \ \ \ \ \ Merge branch bytespersigopLuke Dashjr2016-01-091-8/+10
| |\ \ \ \ \ \ \ \
| | * | | | | | | | -bytespersigop option to additionally limit sigops in transactions we relay ↵Luke Dashjr2015-12-011-8/+10
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | and mine
* | | | | | | | | | 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
| | |_|_|_|_|_|_|_|/ | |/| | | | | | | |
* | | | | | | | | | Merge pull request #7217Wladimir J. van der Laan2016-01-051-1/+1
|\ \ \ \ \ \ \ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 5246180 Mark blocks with too many sigops as failed (Suhas Daftuar)
| * | | | | | | | | | Mark blocks with too many sigops as failedSuhas Daftuar2015-12-151-1/+1
| | |_|_|_|/ / / / / | |/| | | | | | | |
* | | | | | | | | | Merge pull request #7263Wladimir J. van der Laan2016-01-041-2/+2
|\ \ \ \ \ \ \ \ \ \ | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | a5a0831 Double semicolon cleanup. (21E14)
| * | | | | | | | | | Double semicolon cleanup.21E142015-12-301-2/+2
| | |_|_|_|_|/ / / / | |/| | | | | | | |
* / | | | | | | | | Report non-mandatory script failures correctlyPieter Wuille2016-01-031-2/+2
|/ / / / / / / / /
* | | | | | | | | Merge pull request #7062Wladimir J. van der Laan2015-12-211-42/+15
|\ \ \ \ \ \ \ \ \ | |/ / / / / / / / |/| | / / / / / / | | |/ / / / / / | |/| | | | | | | | | | | | | | | | | | | | | | 901b01d Remove GetMinRelayFee (Suhas Daftuar) 27fae34 Use fee deltas for determining mempool acceptance (Suhas Daftuar) 9ef2a25 Update replace-by-fee logic to use fee deltas (Suhas Daftuar) eb30666 Fix mempool limiting for PrioritiseTransaction (Suhas Daftuar)
| * | | | | | | Remove GetMinRelayFeeSuhas Daftuar2015-12-021-35/+0
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | One test in AcceptToMemoryPool was to compare a transaction's fee agains the value returned by GetMinRelayFee. This value was zero for all small transactions. For larger transactions (between DEFAULT_BLOCK_PRIORITY_SIZE and MAX_STANDARD_TX_SIZE), this function was preventing low fee transactions from ever being accepted. With this function removed, we will now allow transactions in that range with fees (including modifications via PrioritiseTransaction) below the minRelayTxFee, provided that they have sufficient priority.
| * | | | | | | Use fee deltas for determining mempool acceptanceSuhas Daftuar2015-12-021-7/+11
| | | | | | | |
| * | | | | | | Update replace-by-fee logic to use fee deltasSuhas Daftuar2015-12-021-7/+11
| |/ / / / / /
* | | / / / / Replace trickle nodes with per-node/message Poisson delaysPieter Wuille2015-12-111-20/+14
| |_|/ / / / |/| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | We used to have a trickle node, a node which was chosen in each iteration of the send loop that was privileged and allowed to send out queued up non-time critical messages. Since the removal of the fixed sleeps in the network code, this resulted in fast and attackable treatment of such broadcasts. This pull request changes the 3 remaining trickle use cases by random delays: * Local address broadcast (while also removing the the wiping of the seen filter) * Address relay * Inv relay (for transactions; blocks are always relayed immediately) The code is based on older commits by Patrick Strateman.
* | | | | | net: Add and document network messages in protocol.hWladimir J. van der Laan2015-12-101-57/+57
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | - Avoids string typos (by making the compiler check) - Makes it easier to grep for handling/generation of a certain message type - Refer directly to documentation by following the symbol in IDE - Move list of valid message types to protocol.cpp: protocol.cpp is a more appropriate place for this, and having the array there makes it easier to keep things consistent.
* | | | | | net: Fix sent reject messages for blocks and transactionsWladimir J. van der Laan2015-12-071-2/+2
| |_|_|_|/ |/| | | | | | | | | | | | | | | | | | | Ever since we #5913 have been sending invalid reject messages for transactions and blocks.
* | | | | Don't do mempool lookups for "mempool" command without a filterMatt Corallo2015-12-051-6/+7
| | | | |
* | | | | Disconnect on mempool requests from peers when over the upload limit.Gregory Maxwell2015-12-031-0/+6
| |_|_|/ |/| | | | | | | | | | | | | | | | | | | Mempool requests use a fair amount of bandwidth when the mempool is large, disconnecting peers using them follows the same logic as disconnecting peers fetching historical blocks.
* | | | Merge pull request #7113Wladimir J. van der Laan2015-12-031-1/+1
|\ \ \ \ | | | | | | | | | | | | | | | 086ee67 Switch to a more efficient rolling Bloom filter (Pieter Wuille)
| * | | | Switch to a more efficient rolling Bloom filterPieter Wuille2015-11-281-1/+1
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | For each 'bit' in the filter we really maintain 2 bits, which store either: 0: not set 1-3: set in generation N After (nElements / 2) insertions, we switch to a new generation, and wipe entries which already had the new generation number, effectively switching from the last 1.5 * nElements set to the last 1.0 * nElements set. This is 25% more space efficient than the previous implementation, and can (at peak) store 1.5 times the requested amount of history (though only 1.0 times the requested history is guaranteed). The existing unit tests should be sufficient.
* | | | | Merge pull request #7133Wladimir J. van der Laan2015-12-031-11/+8
|\ \ \ \ \ | |_|/ / / |/| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | aa4b0c2 When not filtering blocks, getdata sends more in one test (Pieter Wuille) d41e44c Actually only use filterInventoryKnown with MSG_TX inventory messages. (Gregory Maxwell) b6a0da4 Only use filterInventoryKnown with MSG_TX inventory messages. (Patick Strateman) 6b84935 Rename setInventoryKnown filterInventoryKnown (Patick Strateman) e206724 Remove mruset as it is no longer used. (Gregory Maxwell) ec73ef3 Replace setInventoryKnown with a rolling bloom filter. (Gregory Maxwell)
| * | | | Actually only use filterInventoryKnown with MSG_TX inventory messages.Gregory Maxwell2015-11-301-9/+7
| | | | | | | | | | | | | | | | | | | | Previously this logic could erroneously filter a MSG_BLOCK inventory message.
| * | | | Rename setInventoryKnown filterInventoryKnownPatick Strateman2015-11-301-3/+3
| | | | |
| * | | | Replace setInventoryKnown with a rolling bloom filter.Gregory Maxwell2015-11-301-5/+4
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | Mruset setInventoryKnown was reduced to a remarkably small 1000 entries as a side effect of sendbuffer size reductions in 2012. This removes setInventoryKnown filtering from merkleBlock responses because false positives there are especially unattractive and also because I'm not sure if there aren't race conditions around the relay pool that would cause some transactions there to be suppressed. (Also, ProcessGetData was accessing setInventoryKnown without taking the required lock.)
* | | | | PartitionCheck: remove useless spacespaveljanik2015-12-021-3/+3
| | | | |
* | | | | Fix various typospaveljanik2015-12-021-3/+3
| | | | |
* | | | | Flush coins cache also after transaction processingPieter Wuille2015-12-011-0/+1
| | | | |
* | | | | Uncache input txn in utxo cache if a tx is not accepted to mempoolMatt Corallo2015-12-011-3/+22
| | | | |
* | | | | Discard txn cache entries that were loaded for removed mempool txnMatt Corallo2015-12-011-8/+15
| |_|/ / |/| | |
* | | | Expose FormatStateMessageAlex Morcos2015-12-011-1/+1
| | | |
* | | | Store the total sig op count of a tx.Alex Morcos2015-12-011-1/+1
| | | | | | | | | | | | | | | | 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.
* | | | Merge pull request #7141Wladimir J. van der Laan2015-12-011-8/+15
|\ \ \ \ | | | | | | | | | | | | | | | aabc897 rpc: Don't translate warning messages (Wladimir J. van der Laan)
| * | | | rpc: Don't translate warning messagesWladimir J. van der Laan2015-12-011-8/+15
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | But keep translating them in the GUI. This - necessarily - requires duplication of a few messages. Alternative take on #7134, that keeps the translations from being wiped. Also document GetWarnings() input argument. Fixes #5895.
* | | | | Merge pull request #6915Wladimir J. van der Laan2015-12-011-41/+52
|\ \ \ \ \ | |/ / / / |/| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 2d8860e Fix removeForReorg to use MedianTimePast (Suhas Daftuar) b7fa4aa Don't call removeForReorg if DisconnectTip fails (Suhas Daftuar) 7e49f5f Track coinbase spends in CTxMemPoolEntry (Suhas Daftuar) bb8ea1f removeForReorg calls once-per-disconnect-> once-per-reorg (Matt Corallo) 474b84a Make indentation in ActivateBestChainStep readable (Matt Corallo) b0a064c Fix comment in removeForReorg (Matt Corallo) 9b060e5 Fix removal of time-locked transactions during reorg (Matt Corallo) 0c9959a Add failing test checking timelocked-txn removal during reorg (Matt Corallo)
| * | | | Fix removeForReorg to use MedianTimePastSuhas Daftuar2015-11-301-3/+3
| | | | |
| * | | | Don't call removeForReorg if DisconnectTip failsSuhas Daftuar2015-11-301-7/+1
| | | | |
| * | | | Track coinbase spends in CTxMemPoolEntrySuhas Daftuar2015-11-301-1/+12
| | | | | | | | | | | | | | | | | | | | This allows us to optimize CTxMemPool::removeForReorg.
| * | | | removeForReorg calls once-per-disconnect-> once-per-reorgMatt Corallo2015-11-301-8/+14
| | | | |
| * | | | Make indentation in ActivateBestChainStep readableMatt Corallo2015-11-301-33/+33
| | | | |
| * | | | Fix removal of time-locked transactions during reorgMatt Corallo2015-11-301-1/+1
| | | | |
* | | | | Merge pull request #7079Wladimir J. van der Laan2015-12-011-0/+4
|\ \ \ \ \ | |/ / / / |/| | | | | | | | | | | | | | ebb25f4 Limit setAskFor and retire requested entries only when a getdata returns. (Gregory Maxwell) 5029698 prevent peer flooding request queue for an inv (kazcw)
generated by cgit v1.2.3 (git 2.25.1) at 2026-04-21 18:36:48 +0000